#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const int P = 1e9 + 7; 

int n, m, k; 
int fa[30005]; 
i64 f[(1 << 10) + 5], g[(1 << 10) + 5]; 

void solve(void) {
    cin >> n >> m >> k; 
    for (int i = 2; i <= n; ++i) cin >> fa[i]; 
    if (m == 0) return cout << "1\n", void(); 
    if (m == 1) return cout << n * 2 - 1 << "\n", void(); 
    if (k == 0) {
        int ans = 1; 
        for (int i = n; i <= n + m - 1; ++i)
            ans = 1ll * ans * (2 * i - 1) % P; 
        cout << ans << "\n"; 
        return; 
    }

    memset(f, 0, sizeof f); 
    f[0] = 1; 
    for (int i = 1; i <= m; ++i) {
        memset(g, 0, sizeof g); 
        for (int j = 0; j < 1 << k; ++j) if (f[j]) {
            int w = n + i - 1 + __builtin_popcount(j); 
            if (j << 1 < 1 << k)
                g[j << 1] += (2 * w - 1) * f[j], 
                g[j << 1 | 1] += (w - 1) * f[j]; 
            int tmp = j; 
            while (tmp) {
                int x = (tmp & -tmp); tmp ^= x; 
                g[(j ^ x) << 1] += f[j]; 
            }
        }
        for (int j = 0; j < 1 << k; ++j) f[j] = g[j] % P; 
    }
    cout << f[0] << "\n"; 
}

int main(void) {
    ios::sync_with_stdio(0); 
    int c, T; cin >> c >> T; 
    while (T--) solve(); 
    return 0;
}