#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
inline void amax(T &x, U y) {
  if (x < y) x = y;
}
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
class matrix {
 public:
  long long **p, n, m;
  matrix(long long row, long long column) {
    n = row;
    m = column;
    p = new long long *[n];
    for (int i = 0; i < m; i++) p[i] = new long long[m];
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) p[i][j] = 0;
  }
  void accept() {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) cin >> p[i][j];
    }
  }
  void disp() {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) cout << p[i][j] << " ";
      cout << endl;
    }
  }
  friend matrix operator*(matrix, matrix);
};
matrix operator*(matrix a, matrix b) {
  matrix B(1, 1);
  if (a.n == b.m) {
    matrix T(a.m, b.n);
    for (int i = 0; i < a.m; i++) {
      for (int k = 0; k < b.n; k++) {
        T.p[i][k] = 0;
        for (int j = 0; j < a.n; j++) {
          T.p[i][k] += ((a.p[i][j] * b.p[j][k]) % 1000000007);
          T.p[i][k] %= 1000000007;
        }
      }
    }
    B = T;
  }
  return B;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  long long n, l, m, x;
  cin >> n >> l >> m;
  long long tp[n];
  matrix a(m, m), b(m, m), t(m, m);
  l -= 2;
  long long cnt[2][m];
  memset(cnt, 0, sizeof(cnt));
  for (int j = 0; j < 2; j++)
    for (int i = 0; i < n; i++) cin >> x, cnt[j][x % m]++, tp[i] = x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    tp[i] += x;
  }
  for (int i = 0; i < m; i++)
    for (int j = 0; j < m; j++)
      b.p[i][(i + j) % m] = cnt[1][j], a.p[i][(i + j) % m] = cnt[0][j],
                       t.p[i][j] = ((i == j) ? 1 : 0);
  while (l > 0) {
    if (l % 2 == 1) t = t * b;
    b = b * b;
    l /= 2;
  }
  a = a * t;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if ((j + tp[i]) % m == 0) ans += a.p[0][j];
      ans %= 1000000007;
    }
  }
  cout << ans;
  return 0;
}
