#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

pll dif[3000005];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll t, type; cin >> t >> type;
    auto assistant=[&](ll n)
    {
        ll sum=0, Mod=n*2+1;
        vector <ll> a(n), check(n*2+1, 0);
        for (ll& i:a) cin >> i, check[i]=1, sum=(sum+i)%Mod;
        cout << sum << "\n";
        for (ll i=0; i<=n*2; i++)
            if (dif[i].fi!=-1)
            {
                ll s=dif[i].fi+dif[i].se+sum*2;
                if (s%2!=i%2) s+=n*2+1;
                ll a=(s+i)/2, b=(s-i)/2;
                a=(a%Mod+Mod)%Mod, b=(b%Mod+Mod)%Mod;
                if (a!=b && check[a] && check[b])
                    {cout << a << " " << b << "\n"; return;}
            }
    };
    auto magician=[&](ll n)
    {
        ll Mod=n*2+1, fa1, fb1, fa2, fb2; cin >> fa1 >> fb1 >> fa2 >> fb2;
        ll d1=(fa1-fb1+Mod)%Mod, sum1=fa1-dif[d1].fi;
        ll d2=(fa2-fb2+Mod)%Mod, sum2=fa2-dif[d2].fi;
        cout << ((n*2+1-sum1-sum2)%Mod+Mod)%Mod << "\n";
    };
    while (t--)
    {
        ll n, Mod; cin >> n; Mod=n*2+1;
        for (ll i=0; i<=n*2; i++)
            dif[i]={-1, -1};
        auto init=[&](ll a, ll b) {dif[(a-b+Mod)%Mod]={a, b};};
        if (n%2==0)
        {
            for (ll i=n*2; i>=n+2; i--)
                init(i, n*2+1-i);
            init(0, n*2), init(0, 1), init(n*2-3, n+1);
            init(n, 2), init(n, n*2-1), init(4, n+1);
        }
        else
        {
            for (ll i=1; i<=n-1; i++)
                init(i, n*2+1-i);
            init(0, n*2), init(0, 1), init(n, 2);
            init(n, n*2-1), init(4, n+1), init(n*2-3, n+1);
        }
        if (type<=2) assistant(n);
        else magician(n);
    }
}