/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename cnt, typename... A>
void err(T<cnt> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 1e6 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;


int n,m,L;
struct Math{
    int a[105];

    void init(){memset(a,0,sizeof a);}

    Math operator *(const Math b)const {
        Math c;
        c.init();

        for(int i=0l;i<m;i++){
            for(int j=0;j<m;j++){
                (c.a[(i+j)%m]+=a[i]*b.a[j]%MOD)%=MOD;
            }
        }
        return c;
    }
}a,b,c;

Math ksm(Math a,int b){
    Math res;res.init();res.a[0]=1;
    while(b){
        if(b&1)res=res*a;
        b>>=1;
        a=a*a;
    }
    return res;
}


int cnt[N];

void solve(){
     n=rd,L=rd,m=rd;
    a.init(),b.init(),c.init();

    for(int i=1;i<=n;i++){
        a.a[rd%m]++;
    }

    for(int i=1;i<=n;i++){
        int x=rd;
        b.a[x%m]++;
        cnt[i]=x;
    }
    for(int i=1;i<=n;i++){
        int x=cnt[i]+rd;
        c.a[x%m]++;
    }

    // cdbg("OK");


    b=a*ksm(b,L-2)*c;
    cout<<b.a[0]<<endl;

}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);

    int T=rd;
    while(T--){

        memset(cnt,0,sizeof cnt);
        solve();
    }
    


}