大佬求助……为什么样例输出1

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<sstream>
#include<cctype>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<ctime>
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int INF=2147483647,mod=9999973;
inline int read()
{
	int x=0,k=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')k=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return x*k;
}
ll dp[103][103][103],n,m;
int main()
{
	n=read(),m=read();
	dp[0][0][0]=1;
	rep(i,1,n)
		rep(j,0,m)
			rep(k,0,m-j)
			{
				if(dp[i-1][j][k])
				{
					dp[i][j][k]=(dp[i][j][k]+dp[i-1][j][k])%mod;
					if(j>=1)dp[i][j-1][k+1]=(dp[i][j-1][k+1]+dp[i-1][j][k]*j)%mod;
					if(k>=1)dp[i][j][k-1]=(dp[i][j][k-1]+dp[i-1][j][k]*k)%mod;
					if(j>=2)dp[i][j-2][k+2]=(dp[i][j-2][k+2]+dp[i-1][j][k]*j*(j-1)/2)%mod;
					if(k>=2)dp[i][j][k-2]=(dp[i][j][k-2]+dp[i-1][j][k]*k*(k-1)/2)%mod;
					if(j>=1&&k>=1)dp[i][j-1][k]=(dp[i][j-1][k]+dp[i-1][j][k]*j*k)%mod;
				}
			}
	ll ans=0;
	rep(j,0,m)
		rep(k,0,m-j)ans=(ans+dp[n][j][k])%mod;
	printf("%lld",ans);
	return 0;
}