$n^4$ 暴力写挂了

/*
	先巧一个暴力n^4 
*/
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;

const int A = 1e5+10;
const int B = 2e6+10;
const int mod = 9901;
const int inf = 0x3f3f3f3f;

inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  for ( ; !isdigit(c); c = getchar()) if (c == '-') f = -1;
  for ( ; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  return x * f;
}
int n,k;
int f[300][300];
int main()
{
	n=read(),k=read();
	
	f[1][1]=1;
	for (int i=0;i<=n;i++) f[0][i]=1;
	for (int i=2;i<=n;i++)//pos 
	{
		if (!(i&1)) continue;//偶数点不符合提议 
		for (int j=2;j<=(i-1)/2+1;j++)//深度大小 
		{
			for (int k=1;k<i;k++)
			{
				if (!(k&1)) continue; 
				for (int l=0;l<=(i-1-k)/2+1;l++)
				{
					(f[i][j]+=f[k][j-1]*f[i-1-k][l]%mod+mod)%=mod;
				}
			}
		}
	}
	printf("%d",f[n][k]%mod); 
}