&

   / \

  @   #

 / \

@   @

/*

ID: wushuai2

PROG: nocows

LANG: C++

*/

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler

#include <stdio.h>

#include <iostream>

#include <fstream>

#include <cstring>

#include <cmath>

#include <stack>

#include <string>

#include <map>

#include <set>

#include <list>

#include <queue>

#include <vector>

#include <algorithm>

#define Max(a,b) (((a) > (b)) ? (a) : (b))

#define Min(a,b) (((a) < (b)) ? (a) : (b))

#define Abs(x) (((x) > 0) ? (x) : (-(x)))

#define MOD 1000000007

#define pi acos(-1.0)

#define RV(num) ((num) > 0 ? 0 : 1)

using namespace std;

typedef long long           ll      ;

typedef unsigned long long  ull     ;

typedef unsigned int        uint    ;

typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}

template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-      ;

const int M =          ;

const ll P = 10000000097ll   ;

const int INF = 0x3f3f3f3f   ;

const int MAX_N =          ;

const int MAXSIZE = ;

int N, K;

int dp[][];

int main() {

    ofstream fout ("nocows.out");

    ifstream fin ("nocows.in");

    int i, j, k, l, m, n, t, s, c, w, q, num;

    fin >> N >> K;

    for(i = ; i <= N; ++i)

        dp[][i] = ;

    for(j = ; j <= K; ++j){

        for(i = ; i <= N; ++i){

            if(i & ){

                for(k = ; k <= i - ; ++k){

                    if(k & ){

                        dp[i][j] = (dp[k][j - ] * dp[i -  - k][j - ] + dp[i][j]) % ;

                    }

                }

            }

        }

    }

    fout << (dp[N][K] - dp[N][K - ] + ) %  << endl;

    fin.close();

    fout.close();

    return ;

}