# codeforce 9D How many trees?

In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed to get some information from there. For example, he managed to learn that User launches games for pleasure — and then terrible Game Cubes fall down on the city, bringing death to those modules, who cannot win the game…

For sure, as guard Bob appeared in Mainframe many modules stopped fearing Game Cubes. Because Bob (as he is alive yet) has never been defeated by User, and he always meddles with Game Cubes, because he is programmed to this.

However, unpleasant situations can happen, when a Game Cube falls down on Lost Angles. Because there lives a nasty virus — Hexadecimal, who is… mmm… very strange. And she likes to play very much. So, willy-nilly, Bob has to play with her first, and then with User.

This time Hexadecimal invented the following entertainment: Bob has to leap over binary search trees with n nodes. We should remind you that a binary search tree is a binary tree, each node has a distinct key, for each node the following is true: the left sub-tree of a node contains only nodes with keys less than the node’s key, the right sub-tree of a node contains only nodes with keys greater than the node’s key. All the keys are different positive integer numbers from 1 to n. Each node of such a tree can have up to two children, or have no children at all (in the case when a node is a leaf).

In Hexadecimal’s game all the trees are different, but the height of each is not lower than h. In this problem «height» stands for the maximum amount of nodes on the way from the root to the remotest leaf, the root node and the leaf itself included. When Bob leaps over a tree, it disappears. Bob gets the access to a Cube, when there are no trees left. He knows how many trees he will have to leap over in the worst case. And you?

Input

The input data contains two space-separated positive integer numbers n and h (n ≤ 35, h ≤ n).

Output

Output one number — the answer to the problem. It is guaranteed that it does not exceed 9·1018.

Examples

input

3 2

output

5

input

3 3

output

4

题意

用n个点组成二叉树，问高度大于h的有多少个。

题解

对于n个点，我们可以枚举1~n-1作为根节点，设k为根。左子树就是1~k-1，右子树是k+1~n。

设状态为f[n][h]，用n个点组成高度为h的二叉树有多少个。则$f[n][h]=f[k-1][h-1] \times f[n-k-1][h-1]$

```
#include <cstdio>
#define N 36
using namespace std;
long long f[N][N];
int n,h;
main()
{
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<i;k++)
f[i][j]+=f[k][j-1]*f[i-k-1][j-1];
scanf("%d%d",&n,&h);
printf("%lld\n",f[n][35]-f[n][h-1]);
}
```