#include <bits/stdc++.h>
using namespace std;
long long int getT(vector<vector<long long int>>&, int, int);
void _dp(vector<vector<long long int>>& dp, int n) {
  for (int j = 0; j < n; j++) dp[0][j] = 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];
}
int main() {
  int n, h;
  scanf("%d %d", &n, &h);
  vector<vector<long long int>> dp(n + 1, vector<long long int>(n + 1, 0));
  _dp(dp, n);
  cout << dp[n][n] - dp[n][h - 1] << endl;
  return 0;
}
