跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2550. Dima and Two Sequences

  • ID: 2556
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 组合数学
  • 数学
  • 排序
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Dima and Two Sequences

题目描述

D. Dima and Two Sequences
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Little Dima has two sequences of points with integer coordinates: sequence (a1,1),(a2,2),...,(an,n) and sequence (b1,1),(b2,2),...,(bn,n).

Now Dima wants to count the number of distinct sequences of points of length 2·n that can be assembled from these sequences, such that the x-coordinates of points in the assembled sequence will not decrease. Help him with that. Note that each element of the initial sequences should be used exactly once in the assembled sequence.

Dima considers two assembled sequences (p1,q1),(p2,q2),...,(p2·n,q2·n) and (x1,y1),(x2,y2),...,(x2·n,y2·n) distinct, if there is such i (1≤i≤2·n), that (pi,qi)≠(xi,yi).

As the answer can be rather large, print the remainder from dividing the answer by number m.

Input

The first line contains integer n (1≤n≤105). The second line contains n integers a1,a2,...,an (1≤ai≤109). The third line contains n integers b1,b2,...,bn (1≤bi≤109). The numbers in the lines are separated by spaces.

The last line contains integer m (2≤m≤109+7).

Output

In the single line print the remainder after dividing the answer to the problem by number m.

Examples
Input
1
1
2
7
Output
1
Input
2
1 2
2 3
11
Output
2
Note

In the first sample you can get only one sequence: (1,1),(2,1).

In the second sample you can get such sequences : (1,1),(2,2),(2,1),(3,2); (1,1),(2,1),(2,2),(3,2). Thus, the answer is 2.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2196 题。保留原作者与原赛事署名。