A14665 | Mathematics Curriculum

Let $c_1, c_2, \ldots, c_n$ be a permutation of integers $1, 2, \ldots, n$ . Consider all subsegments of this permutation containing an integer $x$ . Given an integer $m$ , we call the integer $x$ good if there are exactly $m$ different values of maximum on these subsegments.

Cirno is studying mathematics, and the teacher asks her to count the number of permutations of length $n$ with exactly $k$ good numbers.

Unfortunately, Cirno isn't good at mathematics, and she can't answer this question. Therefore, she asks you for help.

Since the answer may be very big, you only need to tell her the number of permutations modulo $p$ .

A permutation is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ( $2$ appears twice in the array) and $[1,3,4]$ is also not a permutation ( $n=3$ but there is $4$ in the array).

A sequence $a$ is a subsegment of a sequence $b$ if $a$ can be obtained from $b$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.

The first line contains four integers $n, m, k, p$ ( $1 \le n \le 100, 1 \le m \le n, 1 \le k \le n, 1 \le p \le 10^9$ ).

Output the number of permutations modulo $p$ .