Neural Network country

有一幅有向图，除了源点和汇点有 $ L $ 层，每层 $ n $ 个点。 第 $ i + 1 $ 层的每个点到第 $ i + 2 $ 层的每个点都有一条边，给出源点到第一层的边权，层与层之间的边权，最后一层到汇点的边权，求源点到汇点的路径长度能被 $ m $ 整除的个数。

Due 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 $ .

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 a single integer, the number of paths Doctor G. can take which have total cost divisible by $ M $ , modulo $ 10^{9}+7 $ .

2 3 13
4 6
2 1
3 4

2

 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.