#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define range(i,a,b) for(int i=a;i<=b;++i)
#define LL long long
#define rerange(i,a,b) for(int i=a;i>=b;--i)
#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
using namespace std;
int n,h,dp[205][205];
void init(){
cin>>n>>h;
fill(dp,0);
range(i,1,h)dp[i][1]=1;
}
void solve(){
range(i,1,h)
range(j,3,n) {
range(k, 1, j - 2) {
dp[i][j]=(dp[i][j]+dp[i-1][k]*dp[i-1][j-k-1]%9901)%9901;
++k;
}
++j;
}
cout<<(dp[h][n]-dp[h-1][n]+9901)%9901<<endl;
}
int main() {
init();
solve();
return 0;
}