复杂度O(n*n);;
void init()
{
ll n=100,m=100;
long long i,j;
memset(c,0,sizeof(c));
for(i=0;i<=m;i++)
c[0][i]=c[1][i]=1;
for(i=0;i<=m;i++)
c[i][i]=1;
for(i=0;i<=n;i++)
c[i][0]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(i!=j)
c[i][j]=(c[i][j-1]+c[i-1][j-1])%mod;
// cout<<i<<" "<<j<<" "<<c[i][j]<<endl;
}
}
}
LL C[1005][1005];
void init()
{
C[0][0] = 1;
C[1][0] = C[1][1] = 1;
for(int i = 2; i <= 1000; i++) {
C[i][0] = 1;
for(int j = 1; j <= i; j++)
C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;
}
}