Problem: 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 L1 and L2. Each city from the layer L1 is connected to each city from the layer L2 with the traveling cost cij for <image>, 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 L2 are same for all cities in the L1, that is cij is the same for <image>, 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 ≤ 106), L (2 ≤ L ≤ 105) 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 109 + 7.

Example

Input

2 3 13
4 6
2 1
3 4


Output

2

Note

<image>

This is a country with 3 layers, each layer having 2 cities. Paths <image>, and <image> 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int NR = 105;
const int MR = 1e6 + 10;
const int mod = 1e9 + 7;
void Min(int& x, int y) { x = min(x, y); }
void Max(int& x, int y) { x = max(x, y); }
void Add(int& x, int y) { x = (x + y) % mod; }
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int n, l, m, ans;
int cnt[NR];
int a[MR], b[MR];
int zy[MR];
struct Mashiro {
  int x[NR][NR];
  void init() { memset(x, 0, sizeof(x)); }
  Mashiro operator*(const Mashiro& A) const {
    Mashiro B;
    B.init();
    for (int i = 1; i <= m; i++)
      for (int j = 1; j <= m; j++)
        for (int k = 1; k <= m; k++)
          Add(B.x[i][j], 1ll * x[i][k] * A.x[k][j] % mod);
    return B;
  }
} s, t;
Mashiro ksm(Mashiro A, int b) {
  Mashiro res = A;
  b--;
  while (b) {
    if (b & 1) res = res * A;
    A = A * A;
    b >>= 1;
  }
  return res;
}
int main() {
  n = read(), l = read(), m = read();
  l -= 2;
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    s.x[1][a[i] % m + 1]++;
  }
  for (int i = 1; i <= n; i++) a[i] = read(), cnt[a[i] % m + 1]++;
  for (int j = 1; j <= m; j++) t.x[1][j] = j;
  for (int i = 2; i <= m; i++)
    for (int j = 1; j <= m; j++)
      t.x[i][j] = (t.x[i - 1][j] - 1) + m * (t.x[i - 1][j] - 1 == 0);
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= m; j++) t.x[i][j] = cnt[t.x[i][j]];
  if (l) s = s * ksm(t, l);
  for (int i = 1; i <= n; i++) {
    b[i] = read();
    int p = (a[i] + b[i]) % m;
    if (!p) p += m;
    Add(ans, s.x[1][m - p + 1]);
  }
  printf("%d\n", ans);
  return 0;
}