An undirected graph with vertices is called a symmetric labeled cliquer if each connected
component of the graph contains the same number of vertices and is a clique, and the vertices of the graph are
numbered with numbers from the set .
Maurycy has drawn all symmetric labeled cliquers on a piece of paper
and is going to assess beauty of each of them with a number from
(in particular, different cliquers may be assigned equal grades).
In how many ways can he do this?
The result should be computed modulo .
The figure below depicts all symmetric labeled cliquers for .
The only line of the standard input contains two integers
and (), separated by a single space
and denoting the number of vertices of each symmetric labeled cliquer and the number of grades
The only line of the standard output should contain the number of possible
sets of grades modulo .