#include <cstdio>

#define N 402

#define p 9901

int n, m;

int f[N][N], sum[N][N];

//f[i][j]表示深度为i节点数为j的个数

//sum[i][j]表示深度<=i节点数为j的树的个数

int main()

{

	int i, j, k;

	scanf("%d %d", &n, &m);

	if(!(n & 1))

	{

		puts("0");

		return 0;

	}

	f[1][1] = sum[1][1] = 1;

	for(i = 2; i <= m; i++)

	{

		//两个深度都是i-1

		for(j = 1; j <= n; j++)

			for(k = 1; k <= n; k++)

				f[i][1 + j + k] = (f[i][1 + j + k] + f[i - 1][j] * f[i - 1][k] % p) % p;

		//一个深度为i-1

		for(j = 1; j <= n; j++)

			for(k = 1; k <= n; k++)

				f[i][1 + j + k] = (f[i][1 + j + k] + f[i - 1][j] * sum[i - 2][k] * 2 % p) % p;

		//更新sum

		for(j = 1; j <= n; j++)

			sum[i][j] = (sum[i - 1][j] + f[i][j]) % p;

	}

	printf("%d\n", f[m][n]);

	return 0;

}