AVL-trees
AVL tree - a balanced height binary search tree: for each vertex height of its two subtrees differ by no more than 1. AVL-trees are named by the first letters of the names of their inventors, G.M.Adelson-Belsky and E.M.Landis.
For a fixed number of vertices can have multiple AVL-trees. For example, there are six AVL-trees consisting of five peaks.
Also, trees with the same number of vertices can be of different heights. For example, there are trees of the seven peaks with heights of 2 and 3, respectively.
Required for a given n and h to find the number of AVL-trees, consisting of n vertices and with a height h. Because the answer may be very large, we must find the remainder after dividing the desired amount to 786433.
Input
In the input file are integers n and h (1 ≤ n ≤ 65535, 0 ≤ h ≤ 15).
Output
Bring out one number - the remainder of the division of AVL-trees, consisting of n vertices and with a height h, at 786433.