B'A tree is a connected graph without cycles. Two trees, consisting of n vertices each, are called isomorphic if there exists a permutation p: xe2 x80 x89{1, xe2 x80 x89..., xe2 x80 x89n} xe2 x80 x89 xe2 x86 x92 xe2 x80 x89{1, xe2 x80 x89..., xe2 x80 x89n} such that the edge (u, xe2 x80 x89v) is present in the first tree if and only if the edge (pu, xe2 x80 x89pv) is present in the second tree. Vertex of the tree is called internal if its degree is greater than or equal to two. Count the number of different non-isomorphic trees, consisting of n vertices, such that the degree of each internal vertex is exactly d. Print the answer over the given prime modulo mod. The single line of the input contains three integers n, d and mod (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000, 2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89d xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8910, 108 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89mod xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the number of vertices in the tree, the degree of internal vertices and the prime modulo. Print the number of trees over the modulo mod. '...