/*
ID: 551100k1
LANG: C++
TASK: nocows
*/
#include<stdio.h>
int dp[200][100]={0};
int main(){
freopen("nocows.in","r",stdin);
freopen("nocows.out","w",stdout);
int n,m,i,j,k;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
dp[1][i]=1;
for(j=2;j<=m;j++)
for(i=3;i<=n;i+=2)
for(k=1;k<i-1;k+=2)
dp[i][j]=(dp[i][j]+dp[k][j-1]*dp[i-k-1][j-1])%9901;
printf("%d\n",(dp[n][m]-dp[n][m-1]+9901)%9901);
}
沒有留言:
張貼留言