#include <bits/stdc++.h>
using namespace std;
long long dp[35 + 5][35 + 5];
int main() {
  long long n, h;
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  for (int i = 1; i < 35 + 5; i++) dp[0][i] = 1;
  for (int h = 1; h < 35 + 5; h++) {
    for (int n = 1; n < 35 + 5; n++) {
      for (int k = 0; k < n; k++) {
        dp[n][h] += dp[k][h - 1] * dp[n - k - 1][h - 1];
      }
    }
  }
  while (cin >> n >> h) {
    cout << dp[n][n] - dp[n][h - 1] << endl;
  }
  return 0;
}
