//qoj6756
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 3010, P = 1e9 + 7;
int c, T, n, m, k, f[1<<10], g[1<<10];

void upd(int &x, int y){
	x += y;
	if(x >= P){
		x -= P;
	}
}

int main(){
	scanf("%d%d", &c, &T);
	while(T--){
		scanf("%d%d%d", &n, &m, &k);
		for(int i = 1; i < n; ++ i){
			scanf("%d", &c);
		}
		g[0] = 1;
		for(int i = 1; i <= m; ++ i){
			memset(f, 0, sizeof(f));
			for(int s = 0; s < (1 << k); ++ s){
				if(!g[s]){
					continue;
				}
				int cnt = n + i - 1 + __builtin_popcount(s);
				if(s & 1){
					upd(f[s>>1], g[s]);
				} else {
					upd(f[s>>1], (ll)g[s] * (cnt + cnt - 1) % P);
					for(int j = 0; j < k; ++ j){
						if(!(((s >> 1) >> j) & 1)){
							int t = (s >> 1) ^ (1 << j);
							upd(f[t], (ll)g[s] * (cnt - 1) % P);
						}
					}
				}
			}
			memcpy(g, f, sizeof(g));
		}
		printf("%lld\n", g[0]);
		memset(f, 0, sizeof(f));
		memset(g, 0, sizeof(g));
	}
	return 0;
}