#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

typedef unsigned long long ull;
const int N = 20;

ull fac[N + 1];

ull ptoi(vector<int> v) {
    // TODO: not 0 to n-1
    vector<int> val(v), bit(SZ(v) + 1);
    auto modify = [&](int x) {
        for (; x < SZ(bit); x += x & -x)
            bit[x] += 1;
    };
    auto query = [&](int x) {
        int res = 0;
        for (; x; x -= x & -x)
            res += bit[x];
        return res;
    };
    sort(ALL(val));
    ull res = 0;
    for (int i = 0; i < SZ(v); ++i) {
        int idx = upper_bound(ALL(val), v[i]) - val.begin();
        modify(idx);
        res += fac[SZ(v) - i - 1] * (idx - query(idx));
    }
    return res;
}

vector<int> itop(int n, ull v) {
    vector<int> res, vis(n + 1);
    for (int i = 0; i < n; ++i) {
        int u = v / fac[n - i - 1];
        v %= fac[n - i - 1];
        for (int j = 0; j < n; ++j)
            if (!vis[j]) {
                if (u == 0) {
                    res.pb(j), vis[j] = 1;
                    break;
                }
                else
                    --u;
            }
    }
    return res;
}

const int b = 60;
ull mp[1000];
map<ull, int> rmp;

void gen_mp() {
    mt19937_64 rng(123456);
    for (int i = 1; i <= 500; i++)
        mp[i] = rng() % (1LL<<b), rmp[mp[i]] = i;
    assert(SZ(rmp) == 500);
}

void do_transmit(vector<int> v) {
    ull tt = 0;
    for (int x : v)
        tt ^= mp[x];
    auto p = itop(N, tt);
    vector<int> tmp = v;
    tmp.resize(N);
    sort(ALL(tmp)); 
    vector<int> res(SZ(v));
    for (int i = 0; i < N; i++)
        res[i] = tmp[p[i]];
    for (int i = N; i < SZ(v); i++)
        res[i] = v[i];
    for (int i = 0; i < SZ(v); i++)
        cout << res[i] << " \n"[i + 1 == SZ(v)];
    cout.flush();
}

void do_recover(vector<int> v) {
    ull tt = 0;
    for (int x : v)
        tt ^= mp[x];
    auto test = [&](vector<int> tmp, int targ) {
        assert(SZ(tmp) == N);
        ull r = ptoi(tmp) ^ tt;
        auto it = rmp.find(r);
        if (it == rmp.end())
            return false;
        int t = it->Y;
        if (targ != -1 && targ != t)
            return false;
        v.pb(t);
        for (int i = 0; i < SZ(v); i++)
            cout << v[i] << " \n"[i + 1 == SZ(v)];
        cout.flush();
        return true;
    };
    if (SZ(v) >= N) {
        vector<int> tmp = v;
        tmp.resize(N);
        if (test(tmp, -1))
            return;
    }
    assert(SZ(v) >= N - 1);
    vector<int> L = v;
    L.resize(N - 1);
    bitset<505> bst;
    for (int x : L)
        bst[x] = 1;
    for (int i = 0; i <= N - 1; i++)
        for (int j = 1; j <= 500; j++) {
            if (bst[j])
                continue;
            auto tmp = L;
            tmp.insert(tmp.begin() + i, j);
            if (test(tmp, j))
                return;
        }

    for (int i = 0; i < SZ(v); i++)
        cout << v[i] << " \n"[i + 1 == SZ(v)];
    cout.flush();
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    fac[0] = 1;
    for (int i = 1; i <= N; ++i)
        fac[i] = fac[i - 1] * i;
    /*vector<int> test({3, 1, 0, 4, 5, 6, 2, 7});
    assert(itop(SZ(test), ptoi(test)) == test);*/
    gen_mp();
    string s;
    cin >> s;
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<int> v(n);
        for (int i = 0; i < n; i++)
            cin >> v[i];
        if (s == "transmit")
            do_transmit(v);
        else
            do_recover(v);
    }
}