#include "testlib.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define all(a) begin(a), end(a)

const ll min_t = 1;
const ll max_t = 100'000;

const ll min_n = 1;
const ll max_n = 100'000;
const ll max_sum_n = 100'000;

const ll min_m = 2;
const ll max_m = 1'000'000'000;

int main(){
    registerValidation();

    int testcases = inf.readInt(min_t, max_t);
    inf.readEoln();

    int sum_n = 0;
    for(int t = 0; t < testcases; t++) {
        int n;
        vector<int> p(n),q(n),r(n);
        
        n = inf.readInt(min_n, max_n);
        inf.readSpace();
        inf.readInt(min_m, max_m);
        inf.readEoln();

        for(int i = 0; i < n; i++) {
            p[i] = inf.readInt(1, n);
            if(i < n-1) inf.readSpace();
            else inf.readEoln();
        }
        for(int i = 0; i < n; i++) {
            q[i] = inf.readInt(1, n);
            if(i < n-1) inf.readSpace();
            else inf.readEoln();
        }
        for(int i = 0; i < n; i++) {
            r[i] = inf.readInt(1, n);
            if(i < n-1) inf.readSpace();
            else inf.readEoln();
        }

        sum_n += n;
        sort(p.begin(), p.end());
        sort(q.begin(), q.end());
        sort(r.begin(), r.end());
        for(int i = 0; i < n; i++) {
            assert(p[i] == i+1);
            assert(q[i] == i+1);
            assert(r[i] == i+1);
        }
    }

    inf.readEof();
    assert(sum_n <= max_sum_n);
}