#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

typedef long long i64;
const int MAX_N = 100000 + 5;
const int MAX_M = 50 + 5;
const int P = 1000000007;
const i64 PP = 8ll * P * P;

int T, N, L, M;
int b[MAX_N], fa[MAX_M], fb[MAX_M], fc[MAX_M];

void multi_mod_f_eq(int a[], int b[]) {
    static i64 t[MAX_M << 1];
    for (int i = 0; i < M; i ++) {
        for (int j = 0; j < M; j ++) {
            t[i + j] += 1ll * a[i] * b[j];
            t[i + j] -= t[i + j] >= PP ? PP : 0;
        }
    }
    for (int i = 0; i < M; i ++) {
        a[i] = (t[i] + t[i + M]) % P;
        t[i] = t[i + M] = 0;
    }
}
void power_mod_f_eq(int a[], int b) {
    static int c[MAX_M];
    for (int i = 0; i < M; i ++) c[i] = !i;
    for (; b; b >>= 1) {
        if (b & 1) multi_mod_f_eq(c, a);
        multi_mod_f_eq(a, a);
    }
    for (int i = 0; i < M; i ++) a[i] = c[i];
}

int main() {
    for (T = read_int(); T --; ) {
        N = read_int(), L = read_int(), M = read_int();
        for (int i = 1; i <= N; i ++) fa[read_int()] ++;
        for (int i = 1; i <= N; i ++) fb[b[i] = read_int()] ++;
        for (int i = 1; i <= N; i ++) fc[b[i] += read_int(), b[i] -= b[i] >= M ? M : 0] ++;
        power_mod_f_eq(fb, L - 2);
        multi_mod_f_eq(fc, fb);
        multi_mod_f_eq(fc, fa);
        printf("%d\n", fc[0]);
        for (int i = 0; i < M; i ++) fa[i] = fb[i] = fc[i] = 0;
    }
    return 0;
}