#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

#include<cstdlib>

#include<cmath>

#define mod 9901

#define maxn 250

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

int f[maxn][maxn];

int s[maxn][maxn];

int n,m;

int main(){

    n=read(),m=read();

    for(int i=;i<=m;++i)    f[][i]=;

    for(int j=;j<=m;++j){

        for(int i=;i<=n;++i){

            int &o=f[i][j];

            for(int k=;k<i-;++k)    o=(o+f[k][j-]*f[i-k-][j-])%mod;

        }

    }

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

    return ;

}