#include <bits/stdc++.h>
using namespace std;
const long long N = 102;
long long n, m, l, r, p, t, k, ans, sum, tot, cnt, a[N], b[N], c[N], f[N][N];
inline long long read() {
  register long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
signed main() {
  n = read();
  m = read();
  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][m - 1];
  return 0;
}
