#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 LOG = 20;
const int inf = 1e9;
const double eps = 1e-11;
int n, m, k, qq, t;
int p[N];
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 solve() {
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        cin >> p[i];
        p[i]--;
    }
    
    if (t == 3) {
        cout << "1\n";
        return;
    }
    
    ll out = 1;
    for (int i = 1; i <= m; i++) {
        out = out * i % mod;
    }
    
    cout << out << "\n";
}

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