#include <bits/stdc++.h>

using namespace std;
#pragma GCC optimize("Ofast")

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 3e5 + 10;
const int M = 1e5 + 10;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = 1e16;
const int P = 2;

int mult(int a, int b){
    return a * 1LL * b % mod;
}

int sum(int a, int b){
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

int binpow(int a, int n){
    if (n == 0)
        return 1;
    if (n % 2 == 1){
        return mult(binpow(a, n - 1), a);
    }
    else{
        auto b = binpow(a, n / 2);
        return mult(b, b);
    }
}

int n, k, a[N];

void crypt(){
    cin >> n >> k;
    for(int i = 0; i <= n; i++)
        a[i] = 0;
    vector<int> t(k);
    for(int i = 0; i < k; i++){
        int x;
        cin >> x;
        x--;
        a[x]++;
        t[i] = x;
    }
    vector<int> ret = {};
    int uk = 0;
    for(int i = 0; i < k; i++){
        if(uk <= t[i])
            uk = t[i] + 1;
        while(a[uk % n]){
            uk++;
        }
        a[uk % n] = 1;
        ret.pb(uk % n);
    }
    sort(all(ret));
    for(auto e : ret){
        cout << e + 1 << ' ';
    }
    cout << '\n';
}

void decrypt(){
    cin >> n >> k;
    for(int i = 0; i <= n; i++)
        a[i] = 0;
    vector<int> t(k);
    for(int i = 0; i < k; i++){
        int x;
        cin >> x;
        x--;
        a[x]++;
        t[i] = x;
    }
    vector<int> ret = {};
    int uk = n - 1;
    for(int i = k - 1; i >= 0; i--){
        if(uk >= t[i])
            uk = t[i] - 1;
        while(a[(uk + n) % n]){
            uk--;
        }
        a[(uk + n) % n] = 1;
        ret.pb((uk + n) % n);
    }
    sort(all(ret));
    for(auto e : ret){
        cout << e + 1 << ' ';
    }
    cout << '\n';
}

signed main(){
    mispertion;
    int t = 1;
    int a;
    cin >> a;
    cin >> t;
    while (t--){
        if(a == 1)
            crypt();
        else
            decrypt();
    }
    return 0;
}