Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Neural Network country

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDue to the recent popularity of the Deep learning new countries are starting to look like Neural Networks. That is, the countries are being built deep with many layers, each layer possibly having many cities. They also have one entry, and one exit point.

There are exactly *L* layers, each having *N* cities. Let us look at the two adjacent layers *L*_{1} and *L*_{2}. Each city from the layer *L*_{1} is connected to each city from the layer *L*_{2} with the traveling cost *c*_{ij} for , and each pair of adjacent layers has the same cost in between their cities as any other pair (they just stacked the same layers, as usual). Also, the traveling costs to each city from the layer *L*_{2} are same for all cities in the *L*_{1}, that is *c*_{ij} is the same for , and fixed *j*.

Doctor G. needs to speed up his computations for this country so he asks you to find the number of paths he can take from entry to exit point such that his traveling cost is divisible by given number *M*.

Input

The first line of input contains *N* (1 ≤ *N* ≤ 10^{6}), *L* (2 ≤ *L* ≤ 10^{5}) and *M* (2 ≤ *M* ≤ 100), the number of cities in each layer, the number of layers and the number that travelling cost should be divisible by, respectively.

Second, third and fourth line contain *N* integers each denoting costs 0 ≤ *cost* ≤ *M* from entry point to the first layer, costs between adjacent layers as described above, and costs from the last layer to the exit point.

Output

Output a single integer, the number of paths Doctor G. can take which have total cost divisible by *M*, modulo 10^{9} + 7.

Example

Input

2 3 13

4 6

2 1

3 4

Output

2

Note

This is a country with 3 layers, each layer having 2 cities. Paths , and are the only paths having total cost divisible by 13. Notice that input edges for layer cities have the same cost, and that they are same for all layers.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/22/2021 11:31:54 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|