It was a rainy autumn day. A total of n students attended an olympiad, their intelligence can be ranked with integers a_i. And what a coincidence! Jury prepared exactly n problems, their difficulty can be ranked with integers b_i.

A student can solve a problem if and only if their intelligence a_i is greater or equal than the difficulty b_j of the problem. Jury don’t want to upset participants, so each participant was given one problem they can solve.

Count the amount of ways to distribute problems between students, so that everyone is able to solve the problem they got. Each student should get exactly one problem, and each problem should be given to exactly one student. The answer can be large, so divide the answer by p and output the remainer (compute the answer modulo p).

The first line contains a single integer n — the amount of participants (1 ≤ n ≤ 10⁵).

The second line contains n space-separated integers a_i — values of intelligence of participants (0 ≤ a_i ≤ 10⁹).

The third line contains n space-separated integers b_i — values of difficulty of problems (0 ≤ b_i ≤ 10⁹).

The fourth line contains one integer p (1 ≤ p ≤ 10⁹).

Output a single integer — the amount of ways to distribute the problems according to the statement modulo p.