【数论】lucas定理

C(a,b)=C(a%p,b%p)∗C(a/p,b/p)

inline ll ksm(ll a,ll b)
{
	ll ret=1;
	while(b>0)
	{
		if(b%2==1)
		{
			ret*=a;
			ret%=mod;
		}
		b>>=1;
		a*=a;
		a%=mod;
	}
	return ret;
}
inline ll C(int n,int k)
{
	ll fm=(1LL*f[n-k]*f[k])%mod;
	return 1LL*(f[n]*ksm(fm,mod-2))%mod;	
}
inline ll lucas(ll n,ll m,ll p)
{
	if(m==0) return 1;
	else return C(n%p,m%p)*lucas(n/p,m/p,p)%p;
}