#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000002;
const int MAXM = 200;
const int MOD = 1000000007;
int n, l, m;
int cost[MAXN], start[MAXN], finish[MAXN];
int nr_next[MAXM];
void mmult(const vector<vector<int> >& a, const vector<vector<int> >& b,
           vector<vector<int> >& res) {
  int n = a.size();
  int m = b[0].size();
  int kv = a[0].size();
  assert(kv == b.size());
  if (n == m) {
    for (int j = 0; j < m; j++) {
      res[0][j] = 0;
      for (int k = 0; k < kv; k++) {
        res[0][j] = (res[0][j] + 1ll * a[0][k] * b[k][j]) % MOD;
      }
    }
    for (int i = 1; i < m; i++) {
      for (int j = 0; j < m; j++) {
        res[i][j] = res[0][(-i + j + n) % n];
      }
    }
  } else {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        res[i][j] = 0;
        for (int k = 0; k < kv; k++) {
          res[i][j] = (res[i][j] + 1ll * a[i][k] * b[k][j]) % MOD;
        }
      }
    }
  }
}
void mcopy(const vector<vector<int> >& a, vector<vector<int> >& b) {
  int n = a.size(), m = a[0].size();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      b[i][j] = a[i][j];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> l >> m;
  for (int i = 0; i < n; i++) {
    cin >> start[i];
    start[i] %= m;
  }
  for (int i = 0; i < n; i++) {
    cin >> cost[i];
    cost[i] %= m;
  }
  for (int i = 0; i < n; i++) {
    cin >> finish[i];
    finish[i] %= m;
  }
  vector<vector<int> > p(m, vector<int>(m));
  for (int i = 0; i < n; i++) {
    nr_next[cost[i]]++;
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      p[i][j] = nr_next[(i - j + m) % m];
    }
  }
  vector<vector<int> > res(m, vector<int>(m));
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      res[i][j] = i == j;
    }
  }
  vector<vector<int> > buf(m, vector<int>(m));
  int cl = l - 2;
  while (cl > 0) {
    if (cl % 2 == 1) {
      mmult(res, p, buf);
      mcopy(buf, res);
    }
    mmult(p, p, buf);
    mcopy(buf, p);
    cl /= 2;
  }
  vector<vector<int> > nr_end(m, vector<int>(1));
  for (int i = 0; i < n; i++) {
    nr_end[start[i]][0]++;
  }
  vector<vector<int> > lm1(m, vector<int>(1));
  mmult(res, nr_end, lm1);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    int need = (m + m - cost[i] - finish[i]) % m;
    ans = (ans + lm1[need][0]) % MOD;
  }
  cout << ans << endl;
}
