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