#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
// using u128 = __uint128_t;
// using i128 = __int128;
const int mod = 1000000007;
const int N = 30005;
const int M = 3005;
const int K = 10;
const int LOG = 20;
const int inf = 2e9;
const double eps = 1e-11;
int n, m, k, qq, t;
void print(int x) {
    cout << x;
}

void print(pi x) {
    cout << "[" << x.first << ", " << x.second << "]";   
}

void print(array<int, 3> x) {
    cout << "[" << x[0] << ", " << x[1] << ", " << x[2] << "]";   
}

void print(array<int, 4> x) {
    cout << "[" << x[0] << ", " << x[1] << ", " << x[2] << ", " << x[3] << "]";   
}

template <class T>
void printa(vector<T> &a) {
    cout << "PRINTED:\n";
    int n = a.size();
    for (int i = 0; i < n; i++) {
        cout << "i: " << i << " ";
        print(a[i]);
        cout << "\n";
    }
    
    cout << "\n";
}

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

int mul(int x, int y) {
    return (ll)x * y % mod;    
}

int dp[2][1 << K + 1];
void solve() {
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        int temp;
        cin >> temp;
    }
    
    memset(dp, 0, sizeof(dp));
    dp[1][0] = 1;
    int mx = (1 << k);
    for (int i = 0; i < m; i++) {
        int x = i & 1, y = x ^ 1;
        memset(dp[x], 0, sizeof(dp[x]));
        for (int mask = 0; mask < mx; mask++) {
            int pc = popcount((ui)mask);
            if (mask < (mx >> 1) || k == 0) {
                addx(dp[x][mask << 1], mul(dp[y][mask], 2 * (n + i + pc) - 1));
                addx(dp[x][(mask << 1) | 1], mul(dp[y][mask], n + i + pc - 1));
            }
            
            for (int j = 0; j < k; j++) {
                if ((mask >> j) & 1) addx(dp[x][(mask ^ (1 << j)) << 1], dp[y][mask]);
            }
        }
    }
    
    cout << dp[(m - 1) & 1][0] << "\n";
}

int32_t main() {
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    int tt;
    cin >> t >> tt;
    while (tt--) {
        solve();
    }
}