#include <bits/stdc++.h>
using namespace std;
long long dp[40][40];
int n, h;
void init(int n, int h) {
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  dp[1][1] = 1;
  for (int i = 1; i <= h; i++) dp[1][i] = dp[0][i] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = 2; j <= n; j++) {
      dp[i][j] += dp[i][j - 1];
      for (int k = j - 1; k < i; k++) {
        dp[i][j] += (dp[k][j - 1] - dp[k][j - 2]) * (dp[i - k - 1][j - 2]) * 2;
        dp[i][j] += (dp[k][j - 1] - dp[k][j - 2]) *
                    (dp[i - k - 1][j - 1] - dp[i - k - 1][j - 2]);
      }
    }
  }
}
int main() {
  init(35, 35);
  while (scanf("%d %d", &n, &h) != EOF) {
    cout << dp[n][n] - dp[n][h - 1] << endl;
  }
  return 0;
}
