在某个家谱中，每人都生两个儿子。这些人之间的关系可以用二叉树来表示。这些二叉树总共有N个节点(3 <= N < 200)。这些二叉树有如下性质:

每一个结点的度是0或2。度是这个结点的儿子的数目。

树的高度等于K(1 < K < 100)。高度是从根到任何叶子的最长的路径上的结点的数目。有多少不同的家谱结构? 如果一个家谱的树结构不同于另一个的, 那么这两个家谱就是不同的。输出家谱树的个数除以9901之后的余数。-In a family tree, the person gave birth to two sons. The relationship between these people can be expressed in a binary tree. These binary tree a total of N nodes (3 < = N < 200). The binary tree has the following properties: the degree of each node is 0 or 2. Degree is the son of the number of nodes. Height of the tree is equal to K (1 < K < 100). Height is from the root to any leaf of the longest path of the number of nodes. How many different pedigree structures? If one genealogical tree structure is different from the other, then these two genealogies are different. The output divided by the number of genealogical tree after the remainder of 9901.