bzoj 1801: [Ahoi2009]chess 中国象棋

// MADE BY QT666
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const int N=100050;
const int Mod=9999973;
ll jc[N],inv[N],dp[105][105][105],n,m;
ll qpow(ll a,ll b){ll ans=1;while(b){if (b&1) (ans*=a)%=Mod;(a*=a)%=Mod,b>>=1;}return ans;}
ll C(int n,int m){
  return jc[n]*inv[m]%Mod*inv[n-m]%Mod;
}
int main(){
  scanf("%d%d",&n,&m);
  jc[0]=1;for(int i=1;i<=m;i++) (jc[i]=jc[i-1]*i)%=Mod;
  for(int i=0;i<=m;i++) inv[i]=qpow(jc[i],Mod-2);
  dp[0][m][0]=1;
  for(int i=1;i<=n;i++){
    for(int j=0;j<=m;j++){
      for(int k=0;k<=m;k++){
    (dp[i][j][k]+=dp[i-1][j][k])%=Mod;
    if(k-1>=0) (dp[i][j][k]+=C(j+1,1)*dp[i-1][j+1][k-1])%=Mod;
    if(k-2>=0) (dp[i][j][k]+=C(j+2,2)*dp[i-1][j+2][k-2])%=Mod;
    (dp[i][j][k]+=C(k+1,1)*dp[i-1][j][k+1])%=Mod;
    (dp[i][j][k]+=C(k+2,2)*dp[i-1][j][k+2])%=Mod;
    (dp[i][j][k]+=C(j+1,1)*C(k,1)%Mod*dp[i-1][j+1][k])%=Mod;
      }
    }
  }
  ll ans=0;
  for(int i=0;i<=m;i++)
    for(int j=0;j<=m;j++)(ans+=dp[n][i][j])%=Mod;
  printf("%lld\n",ans);
  return 0;
}