#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 1000000007

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,k,fa[maxn];
ull f[1<<10|5],g[1<<10|5];
int popc[1<<10|5];

void work()
{
	n=read(),m=read(),k=read();
	For(i,2,n)fa[i]=read();
	if(k==0){
		ull res=1;
		For(i,n,n+m-1)res=res*(i*2-1)%mod;
		cout<<res<<"\n";
		return;
	}
	memset(f,0,sizeof f),f[0]=1;
	int mxs=1<<k;
	int K=k-2;
	For(i,n,n+m-1){
		For(s,(1<<(k-1)),(1<<k)-1)
			g[(s<<1)&(mxs-1)]+=f[s];
		For(s,0,(1<<(k-1))-1){
			Rep(j,K,0)
				if(s>>j&1) g[(s^(1<<j))<<1]+=f[s];
			g[s<<1]+=f[s]*((i+popc[s])*2-1);
			g[s<<1|1]+=f[s]*(i+popc[s]-1);
		}
		For(s,0,mxs-1) f[s]=g[s]%mod,g[s]=0;
	}
	cout<<f[0]<<"\n"; 
}

signed main()
{
	For(i,1,(1<<10)-1)popc[i]=popc[i>>1]+(i&1);
	read();int T=read();
	while(T--)work();
	return 0;
}