#include <bits/stdc++.h>
using namespace std;
long long dp[36][36];
void init() {
  int n = 36;
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  for (int i = 1; i < n; ++i) {
    for (int h = 1; h < n; ++h) {
      for (int m = 1; m <= i; ++m) {
        long long right_count = 0;
        long long left_count = 0;
        for (int x = 0; x < h; ++x) right_count += dp[i - m][x];
        long long result1 = right_count * dp[m - 1][h - 1];
        for (int x = 0; x < h - 1; ++x) left_count += dp[m - 1][x];
        long long result2 = left_count * dp[i - m][h - 1];
        dp[i][h] += (result1 + result2);
      }
    }
  }
}
int main() {
  int n, h;
  cin >> n >> h;
  init();
  long long sum = 0;
  for (int i = h; i <= n; ++i) sum += dp[n][i];
  cout << sum << endl;
  return 0;
}
