Levko loves all sorts of sets very much.
Levko has two arrays of integers a1,a2,... ,an and b1,b2,... ,bm and a prime number p. Today he generates n sets. Let's describe the generation process for the i-th 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.
The first line contains three integers n, m and p (1≤n≤104, 1≤m≤105, 2≤p≤109), p is prime.
The second line contains space-separated integers a1,a2,... ,an (1≤ai<p). The third line contains space-separated integers b1,b2,... ,bm (1≤bi≤109).
The single number − the size of the union of the sets.
1 1 7
2
5
3
1 2 7
2
2 4
3
2 1 7
1 6
2
1
2 1 7
1 6
5
2