//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
int mod = 1e9 + 7;
int dp[300][300][300];
int calced[300][300][300];//011 101 110
int pls(int a, int b) {
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}
int mult(int a, int b) {
    return 1ll * a * b % mod;
}
int getv(int a, int b, int c) {
    if (calced[a][b][c])
        return dp[a][b][c];
    if (a == 0 and b == 0 and c == 0)
        return 1;
    calced[a][b][c] = 1;
    vector<pair<int, int>> step1 = {{1, 0}, {2, -1}};
    vector<pair<int, int>> step2 = {{0, -1}, {2, 1}};
    vector<pair<int, int>> step3 = {{0, 2}, {1, -1}};
    for (auto op1 : step1) {
        array<int, 3> abac = {a, b, c};
        int reba = 1;
        bool okidoki = 0;
        if (abac[op1.first]) {
            reba = mult(reba, abac[op1.first]);
            abac[op1.first]--;
            if (op1.second != -1)
                abac[op1.second]++;
            else
                okidoki = 1;
            //cout << a << ' ' << b << ' ' << c << "->" << abac[0] << ' ' << abac[1] << ' ' << abac[2] << endl;
            for (auto op2 : step2) {
                int rebacop = reba;
                array<int, 3> abaccop = abac;
                bool okidokicop = okidoki;
                if (abaccop[op2.first]) {
                    rebacop = mult(rebacop, abaccop[op2.first]);
                    abaccop[op2.first]--;
                    if (op2.second != -1)
                        abaccop[op2.second]++;
                    else
                        okidokicop = 1;
                    //cout << a << ' ' << b << ' ' << c << "->" << abac[0] << ' ' << abac[1] << ' ' << abac[2] << endl;
                    for (auto op3 : step3) {
                        int rebacopcop = rebacop;
                        array<int, 3> abaccopcop = abaccop;
                        bool okidokicopcop = okidokicop;
                        if (abaccopcop[op3.first]) {
                            rebacopcop = mult(rebacopcop, abaccopcop[op3.first]);
                            abaccopcop[op3.first]--;
                            if (op3.second != -1)
                                abaccopcop[op3.second]++;
                            else
                                okidokicopcop = 1;
                            //cout << a << ' ' << b << ' ' << c << "->" << abaccopcop[0] << ' ' << abaccopcop[1] << ' ' << abaccopcop[2] << endl;
                            if (okidokicopcop)
                                dp[a][b][c] = pls(dp[a][b][c], mult(getv(abaccopcop[0], abaccopcop[1], abaccopcop[2]), rebacopcop));
                        }
                    }
                }
            }
        }
    }
    return dp[a][b][c];
}
int n;
void solve() {
    vector<vector<int>> beba(3 * n);
    for (int i = 0; i < 2 * n; ++i) {
        int x;
        cin >> x;
        x--;
        beba[x].push_back(0);
    }
    for (int i = 0; i < 2 * n; ++i) {
        int x;
        cin >> x;
        x--;
        beba[x].push_back(1);
    }
    for (int i = 0; i < 2 * n; ++i) {
        int x;
        cin >> x;
        x--;
        beba[x].push_back(2);
    }
    int a = 0, b = 0, c = 0;
    for (int i = 0; i < 3 * n; ++i) {
        sort(all(beba[i]));
        if (beba[i][0] == 1 and beba[i][1] == 2)
            a++;
        if (beba[i][0] == 0 and beba[i][1] == 2)
            b++;
        if (beba[i][0] == 0 and beba[i][1] == 1)
            c++;
    }
    cout << getv(a, b, c) << endl;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    cin >> n >> t;
    while (t--) {
        solve();
    }
}