#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <vector>

#include <iomanip>

#include <cstring>

#include <map>

#include <queue>

#include <set>

#include <cassert>

#include <stack>

#include <bitset>

#define mkp make_pair

using namespace std;

const double EPS=1e-;

typedef long long lon;

const lon SZ=,INF=0x7FFFFFFF,mod=;

int dp[][],arr[][];

int main()

{

    std::ios::sync_with_stdio();

    //freopen("d:\\1.txt","r",stdin);

    lon casenum;

    //cin>>casenum;

    //for(lon time=1;time<=casenum;++time)

    {

        int n,k;

        cin>>n>>k;

        for(int i=;i<;++i)arr[][i]=;

        dp[][]=;

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

        {

            if(i&)

            for(int j=;j<=k;++j)

            {

                for(int p=i-;p>=;p-=)

                {

                    dp[i][j]+=*dp[p][j-]*arr[i--p][j-]%mod;

                    dp[i][j]-=dp[p][j-]*dp[i--p][j-];

                }

                dp[i][j]%=mod;

                arr[i][j]=arr[i][j-]+dp[i][j];

                arr[i][j]%=mod;

                //if(i==3)cout<<j<<" "<<dp[i][j]<<endl;

            }

        }

        cout<<(dp[n][k]+mod)%mod<<endl;

    }

    return ;

}