#include <iostream>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 110, mod = 1e9 + 7;

ll f[MAXN][MAXN][MAXN];
int bel[MAXN * 3], cnt[4][4];

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif

    f[0][0][0] = 1;
    for (int t = 1; t <= 300; t++)
    {
        for (int i = 0; i <= t && i <= 100; i++)
            for (int j = 0; i + j <= t && j <= 100; j++)
            {
                if (t - i - j > 100) continue;
                int k = t - i - j;
                if (i >= 2 && j >= 1) f[i][j][k] = (f[i][j][k] + f[i - 1][j - 1][k + 1] * i * (i - 1) * j) % mod;
                if (i >= 2) f[i][j][k] = (f[i][j][k] + f[i - 2][j][k] * i * (i - 1) * (k + 1)) % mod;
                if (i >= 1 && j >= 2) f[i][j][k] = (f[i][j][k] + f[i][j - 2][k] * i * j * (j - 1)) % mod;
                if (i >= 1 && j >= 1 && k >= 1) f[i][j][k] = (f[i][j][k] + f[i - 1][j - 1][k - 1] * i * j * k) % mod;
                if (i >= 1 && k >= 1) f[i][j][k] = (f[i][j][k] + f[i - 1][j + 1][k - 1] * i * k * k) % mod;
                if (j >= 1 && k >= 1) f[i][j][k] = (f[i][j][k] + f[i + 1][j - 1][k - 1] * (j + 1) * j * k) % mod;
                if (k >= 2) f[i][j][k] = (f[i][j][k] + f[i][j][k - 2] * (j + 1) * k * (k - 1)) % mod;
            }
    }

    int n, T;
    Read(n), Read(T);
    while (T--)
    {
        for (int i = 1; i <= 3 * n; i++) bel[i] = 0;
        for (int i = 1; i <= 3; i++)
            for (int j = 1; j <= 3; j++)
                cnt[i][j] = 0;
        for (int i = 1, x; i <= 3; i++)
            for (int j = 1; j <= 2 * n; j++)
            {
                Read(x);
                if (bel[x]) cnt[bel[x]][i]++;
                bel[x] = i;
            }
        cout << f[cnt[1][2] + cnt[2][1]][cnt[2][3] + cnt[3][2]][cnt[1][3] + cnt[3][1]] << '\n';
    }
    return 0;
}