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