#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const int MAXN=103;
const int M=9999973;
long long f[MAXN][MAXN][MAXN],i,j,k,n,m,ans;
int main()
{
freopen("cchess.in","r",stdin);
freopen("cchess.out","w",stdout);
scanf("%d%d",&n,&m);
f[0][0][0]=1;
for (i=1;i<=n;i++)
{
for (j=0;j<=m;j++)
for (k=0;k<=m-j;k++)
{
int kong=m-j-k;
f[i][j][k]=f[i-1][j][k];
if (j)
{
f[i][j][k]+=f[i-1][j-1][k+1]*(k+1);
if (j>1) f[i][j][k]+=f[i-1][j-2][k+2]*(k+2)*(k+1)/2;
}
if (k && j) f[i][j][k]+=f[i-1][j-1][k]*k*(kong+1);
if (k>=2) f[i][j][k]+=f[i-1][j][k-2]*(kong+2)*(kong+1)/2;
if (k) f[i][j][k]+=f[i-1][j][k-1]*(kong+1);
f[i][j][k]=f[i][j][k]%M;
}
}
for (i=0;i<=m;i++)
for (j=0;j<=m;j++)
ans+=f[n][i][j];
ans=ans%M;
cout<<ans<<endl;
return 0;
}