#include <bits/stdc++.h>
using namespace std;
long long f[40][40], n, h;
signed main() {
  cin >> n >> h;
  for (long long i = 0; i <= n; i++) f[0][i] = 1;
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= n; j++)
      for (long long k = 0; k < i; k++)
        f[i][j] += f[k][j - 1] * f[i - k - 1][j - 1];
  cout << f[n][n] - f[n][h - 1];
  return 0;
}
