#include <bits/stdc++.h>
using namespace std;
template <typename T>
void r1(T &x) {
  x = 0;
  char c(getchar());
  int f(1);
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -1;
  for (; '0' <= c && c <= '9'; c = getchar()) x = (x * 10) + (c ^ 48);
  x *= f;
}
const int maxn = 1e2 + 5;
const int maxm = 1e6 + 5;
const int mod = 1e9 + 7;
typedef int room[maxn];
template <int mod>
struct typemod {
  int z;
  typemod(int a = 0) : z(a) {}
  inline int inc(int a, int b) const {
    return a += b - mod, a + ((a >> 31) & mod);
  }
  inline int dec(int a, int b) const { return a -= b, a + ((a >> 31) & mod); }
  inline int mul(int a, int b) const { return 1ll * a * b % mod; }
  typemod<mod> operator+(const typemod<mod> &x) const {
    return typemod(inc(z, x.z));
  }
  typemod<mod> operator-(const typemod<mod> &x) const {
    return typemod(dec(z, x.z));
  }
  typemod<mod> operator*(const typemod<mod> &x) const {
    return typemod(mul(z, x.z));
  }
  typemod<mod> &operator+=(const typemod<mod> &x) {
    *this = *this + x;
    return *this;
  }
  typemod<mod> &operator-=(const typemod<mod> &x) {
    *this = *this - x;
    return *this;
  }
  typemod<mod> &operator*=(const typemod<mod> &x) {
    *this = *this * x;
    return *this;
  }
  int operator==(const typemod<mod> &x) const { return x.z == z; }
  int operator!=(const typemod<mod> &x) const { return x.z != z; }
};
int n, m, l;
struct Matrix {
  typemod<mod> a[maxn][maxn];
  Matrix(void) { memset(a, 0, sizeof(a)); }
  Matrix operator*(const Matrix &z) const {
    Matrix ans;
    for (int i = 0; i < m; ++i) {
      for (int j = 0; j < m; ++j) {
        for (int k = 0; k < m; ++k) {
          ans.a[i][j] += a[i][k] * z.a[k][j];
        }
      }
    }
    return ans;
  }
} S, G;
Matrix ksm(Matrix x, int mi) {
  Matrix res;
  for (int i = 0; i < m; ++i) res.a[i][i] = 1;
  while (mi) {
    if (mi & 1) res = res * x;
    mi >>= 1;
    x = x * x;
  }
  return res;
}
int a[maxm];
signed main() {
  int i, j;
  r1(n), r1(l), r1(m);
  for (i = 1; i <= n; ++i) {
    r1(a[i]), S.a[0][a[i] % m] += 1;
  }
  for (i = 1; i <= n; ++i) {
    r1(a[i]), a[i] %= m;
    for (j = 0; j < m; ++j) G.a[j][(j + a[i]) % m] += 1;
  }
  S = S * ksm(G, l - 2);
  typemod<mod> ans(0);
  for (i = 1; i <= n; ++i) {
    int x;
    r1(x);
    ans += S.a[0][(2 * m - x - a[i]) % m];
  }
  printf("%d\n", ans.z);
  return 0;
}
