#include<bits/stdc++.h>
using namespace std;
int t, n, m, l, a[100005], b[100005], c[100005];
const long long mod = 1000000007;
long long f[2][55];
struct Matrix {
	long long data[55][55], h, l;
	inline Matrix() {
		memset(data, 0, sizeof(data));
	}
	inline Matrix operator*(const Matrix &t)const {
		Matrix x;
		x.h = h;
		x.l = t.l;
		for (long long i = 1; i <= x.h; i++) {
			for (long long j = 1; j <= x.l; j++) {
				for (long long k = 1; k <= l; k++) {
					x.data[i][j] = ((data[i][k] * t.data[k][j]) % mod + x.data[i][j]) % mod;
				}
			}
		}
		return x;
	}
	inline Matrix operator^(long long x)const {
		Matrix res, base;
		res.h = res.l = base.h = base.l = h;
		for (long long i = 1; i <= h; i++) {
			res.data[i][i] = 1;
		}
		for (long long i = 1; i <= h; i++) {
			for (long long j = 1; j <= l; j++) {
				base.data[i][j] = (data[i][j] ) % mod;
			}
		}
		while (x) {
			if (x & 1) {
				res = res * base;
			}
			base = base * base;
			x >>= 1;
		}
		return res;
	}
};
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> t;
	while (t--) {
		cin >> n >> l >> m;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			a[i] %= m;
		}
		for (int i = 1; i <= n; i++) {
			cin >> b[i];
			a[i] %= m;
		}
		for (int i = 1; i <= n; i++) {
			cin >> c[i];
			a[i] %= m;
		}
		memset(f, 0, sizeof(f));
		if (l == 2) {
			for (int i = 1; i <= n; i++) {
				f[0][a[i]] = 1;
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 0; j < m; j++) {
					f[1][(j + (b[i] + c[i])) % m] += f[0][j];
					f[1][(j + (b[i] + c[i])) % m] %= mod;
				}
			}
			cout << f[1][0] << "\n";
		} else {
			Matrix cnt, ans;
			cnt.h = 1, cnt.l = m;
			cnt.data[1][1] = 1;
			ans.h = m, ans.l = m;
			for (int i = 1; i <= m; i++) {
				for (int j = 1; j <= n; j++) {
					ans.data[i][(b[j] + i - 1) % m + 1]++;
				}
			}
			ans = ans ^ (l - 2);
			cnt = cnt * ans;
			for (int i = 0; i < m; i++) {
				f[0][i] = cnt.data[1][i + 1];
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 0; j < m; j++) {
					f[1][(j + (b[i] + c[i])) % m] += f[0][j];
					f[1][(j + (b[i] + c[i])) % m] %= mod;
				}
			}
			for (int j = 0; j < m; j++) {
				f[0][j] = 0;
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 0; j < m; j++) {
					f[0][(j + (a[i])) % m] += f[1][j];
					f[0][(j + (a[i])) % m] %= mod;
				}
			}
			cout << f[0][0] << "\n";
		}
	}
}