Levko and Sets

3000ms

262144K

Description:

Levko loves all sorts of sets very much.

Levko has two arrays of integers a₁, a₂, ... , a_n and b₁, b₂, ... , b_m and a prime number p. Today he generates n sets. Let's describe the generation process for the i-th set:

First it has a single number 1.
Let's take any element c from this set. For all j (1 ≤ j ≤ m) if number (c·a_i^b_j) mod p doesn't occur in the set, then add it to the set.
Repeat step 2 as long as we can add at least one element to our set.

Levko wonders, how many numbers belong to at least one set. That is, he wants to know what size is the union of n generated sets.

Input:

The first line contains three integers n, m and p (1 ≤ n ≤ 10⁴, 1 ≤ m ≤ 10⁵, 2 ≤ p ≤ 10⁹), p is prime.

The second line contains space-separated integers a₁, a₂, ... , a_n (1 ≤ a_i < p). The third line contains space-separated integers b₁, b₂, ... , b_m (1 ≤ b_i ≤ 10⁹).

Output:

The single number — the size of the union of the sets.

Sample Input:

1 1 7
2
5

Sample Output:

Sample Input:

1 2 7
2
2 4

Sample Output:

Sample Input:

2 1 7
1 6
2

Sample Output:

Sample Input:

2 1 7
1 6
5

Sample Output:

Informação

Provedor Codeforces

Código CF360D