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