样例能过但0pts求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 9999973;
int n, m, dp[105][105][105], ans;
int QWQ(int x)
{
	return ((x * (x - 1)) / 2) % mod;
}
signed main()
{
	cin >> n >> m;
	dp[0][0][0] = 1;
	for(int i = 1; i <= n; i ++)
	{
		for(int j = 0; j <= m; j ++)
		{
			for(int k = 0; k <= m - j; k ++)
			{
				dp[i][j][k] = dp[i - 1][j][k];
				if(k > 0)
				{
					dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j + 1][k - 1] * (j + 1)) % mod;
				}
				if(j > 0)
				{
					dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j - 1][k] * (m - j - k + 1)) % mod;
				}
				if(k > 1)
				{
					dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j + 2][k - 2] * QWQ(j + 2)) % mod;
				}
				if(j > 1)
				{
					dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j - 2][k] * QWQ(m - j - k + 2));
				}
			}
		}
	}
	for(int i = 0; i <= m; i ++)
	{
		for(int j = 0; j <= m; j ++)
		{
			ans = (ans + dp[n][i][j]) % mod;	
		}
	}
	cout << ans << endl;
}