#include <bits/stdc++.h>
using namespace std;
long long int dp[50][50];
int m, n;
int main() {
  for (int x = 0; x < 36; x++) {
    dp[0][x] = 1;
  }
  for (int x = 1; x < 36; x++)
    for (int y = 1; y < 36; y++)
      for (int z = 0; z < x; z++) {
        dp[x][y] += dp[z][y - 1] * dp[x - z - 1][y - 1];
      }
  cin >> m >> n;
  cout << dp[m][35] - dp[m][n - 1] << endl;
}
