#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int a[4][1000005];
long long M[105][105];
long long T[105][105];
long long tmp[105][105];
long long B[105];
int mark[105];
long long res[105];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  int n, L, m;
  cin >> n >> L >> m;
  for (int i = 1; i <= 3; i++)
    for (int j = 1; j <= n; j++) cin >> a[i][j], a[i][j] %= m;
  for (int i = 1; i <= n; i++) {
    int v = a[1][i];
    int t = a[2][i];
    B[v]++;
    mark[t]++;
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      if (!mark[j]) continue;
      int x = (i - j + m) % m;
      T[i][x] += mark[j];
    }
  }
  int y = L;
  L -= 2;
  bool start = 0;
  while (L) {
    if (L % 2 == 1) {
      if (!start)
        for (int i = 0; i < m; i++)
          for (int j = 0; j < m; j++) M[i][j] = T[i][j];
      else {
        memset(tmp, 0, sizeof(tmp));
        for (int i = 0; i < m; i++) {
          for (int j = 0; j < m; j++) {
            for (int k = 0; k < m; k++) {
              tmp[i][j] = (tmp[i][j] + M[i][k] * T[k][j]) % mod;
            }
          }
        }
        for (int i = 0; i < m; i++)
          for (int j = 0; j < m; j++) M[i][j] = tmp[i][j];
      }
      start = 1;
    }
    memset(tmp, 0, sizeof(tmp));
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < m; j++) {
        for (int k = 0; k < m; k++) {
          tmp[i][j] = (tmp[i][j] + T[i][k] * T[k][j]) % mod;
        }
      }
    }
    for (int i = 0; i < m; i++)
      for (int j = 0; j < m; j++) T[i][j] = tmp[i][j];
    L /= 2;
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      res[i] = (res[i] + M[i][j] * B[j]) % mod;
    }
  }
  if (y == 2) {
    for (int i = 0; i < m; i++) {
      res[i] = (res[i] + B[i]) % mod;
    }
  }
  memset(tmp, 0, sizeof(tmp));
  for (int i = 0; i < m; i++) {
    if (!mark[i]) continue;
    for (int j = 0; j < m; j++) {
      int x = (j - i + m) % m;
      tmp[i][j] = (tmp[i][j] + res[x]) % mod;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int v = a[3][i];
    int t = a[2][i];
    int x = (0 - v + m) % m;
    ans = (ans + tmp[t][x]) % mod;
  }
  cout << ans << endl;
}
