求c(n,m)mod p ,p是素数;
n = qp + r
m = sp + t
c(n,m) = c(q,s)*c(r,t) (mod p) = c(q,s) * c(q%mod,s%mod);
int c(int nn, int mm, int mod)
{
if(mm > nn) return 0;
return 1ll * f[nn] * inv[mm] %mod * inv[nn - mm] % mod;
}
int lucas(int nn, int mm, int mod)
{
if(mm == 0) return 1;
return 1ll * lucas(nn/mod,mm/mod,mod) * c(nn%mod,mm%mod,mod) % modd;
}