题号：NC224140
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
A Derangement is a permutation p of 1, 2, . . . , n where 
for all i from 1 to n. A rotation of a sequence 
with offset %5C)
is equal to the sequence 
. A sequence of length n has at most n distinct rotations. Given a derangement 
, let %5C)
denote the number of distinct rotations of D that are also derangements. For example, %20%3D%201%2C%20f(%5B3%2C%201%2C%202%5D)%20%3D%202%5C)
. Given n and a prime number p, count the number of derangements D of 1, 2, . . . , n such that
%20%3D%20n%20%E2%88%92%202%5C)
, modulo p.
输入描述:
The single line of input contains two integersand
, where n is a permutation size, and p is a prime number.
输出描述:
Output a single integer, which is the number of derangements D of size n with