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

vector<int> gperm(int n){
    vector<int> p(2*n+1); iota(p.begin(), p.end(), 0);
    shuffle(p.begin(), p.end(), mt19937(24032006));
    return p;
}
struct cplayer{
    cplayer(){
        int n; cin >> n;
        vector<int> p = gperm(n);
        vector<int> a(n), b(n);
        vector<pair<int, int>> b_sorted(n);
        for (int i=0; i<n; i++){
            cin >> a[i];
            b[i] = p[a[i]];
            b_sorted[i] = {b[i], i};
        }
        sort(b_sorted.begin(), b_sorted.end());

        int x = 0;
        for (int i=0; i<p.size(); i++) x ^= p[i];
        for (int i=0; i<n; i++) x = x ^ b[i];

        for (int i=0; i<n; i++){
            int y = x ^ b[i];
            auto it = lower_bound(b_sorted.begin(), b_sorted.end(), pair<int, int> (y, -1));
            if (it == b_sorted.end() || it->first != y || it->second == i) continue;
            cout << a[i] << " " << a[it->second] << "\n";
            return;
        }
    }
};

struct hplayer{
    hplayer(){
        int n; cin >> n;
        vector<int> p = gperm(n);
        
        int x = 0;
        for (int i=0; i<p.size(); i++) x ^= p[i];
        for (int i=0; i<4; i++){
            int v; cin >> v; x ^= p[v];
        }
        cout << find(p.begin(), p.end(), x) - p.begin() << "\n";
    }
};
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    // freopen("trick.in", "r", stdin);
    // freopen("trick.out", "w", stdout);

    int t, r; cin >> t >> r;
    if (r == 1 || r == 2){
        for (int i=0; i<t; i++){
            cplayer();
        }
    }
    else{
        for (int i=0; i<t; i++){
            hplayer();
        }
    }
}