An undirected graph is called a labeled cliquer if each connected
component of the graph is a clique and the vertices of the graph are
numbered with numbers from the set .
Maurycy has drawn all labeled cliquers with vertices on a piece of paper
and is going to assess beauty of each of them with a number from
the set
(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 labeled cliquers for .
Input
The only line of the standard input contains two integers
and (), separated by a single space
and denoting the number of vertices of each labeled cliquer and the number of grades
respectively.
Output
The only line of the standard output should contain the number of possible
sets of grades modulo .
Example
For the input data:
3 2
the correct result is:
32
Task author: Tomasz Idziaszek.
Kontakt
W razie problemów technicznych ze Szkopułem, prosimy o kontakt mailowy pod adresem szkopul@fri.edu.pl.
Jeśli chciałbyś porozmawiać o zadaniach, rozwiązaniach lub problemach technicznych, odwiedź nasze serwery na Discordzie. Są one moderowane przez społeczność, ale członkowie zespołu wsparcia również aktywnie się tam udzielają.