#include <bits/stdc++.h>   using namespace std;   int n, m;   long long f[102][102];   int main() {     scanf( %d%d , &n, &m);     for (int i = 0; i <= n; i++) f[0][i] = 1;     for (int j = 1; j <= n; j++)       for (int i = 1; i <= n; i++)         for (int k = 0; k < i; k++) f[i][j] += f[k][j - 1] * f[i - k - 1][j - 1];     printf( %lld , f[n][n] - f[n][m - 1]);   }   