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

vector <int> build_perm(vector <int> v, int x = 0)
{
	if (x)
		v.insert(lower_bound(v.begin(), v.end(), x), x);
	
	int s = 0;
	for (auto i : v)
		s += i;
  
  srand(s);
  for (int i = 0; i < (int)v.size(); ++i) {
    swap(v[i], v[rand() % (i + 1)]);
  }

	// mt19937 rnd(s);
	// shuffle(v.begin(), v.end(), rnd);
	
  return v;
}

bool match(const vector <int>& a, const vector <int>& b, int val)
{
	/// a contine val si b nu
	for (int i = 0, j = 0; j < b.size(); i++, j++) {
		if (a[i] == val)
			i++;
		if (a[i] != b[j])
			return 0;
	}
	return 1;
}

void Recover()
{
	int n;
	cin >> n;
	vector <int> v(n);
	vector <int> apar(501);

	for (auto & i : v) {
		cin >> i;
		apar[i] = 1;
	}

	vector <int> v_sorted = v;
	sort(v_sorted.begin(), v_sorted.end());


	if (build_perm(v_sorted) == v) {
		for (auto i : v)
			cout << i << ' ';
		cout << '\n';
		return;
	} 

	for (int i = 1; i <= 500; i++) {
		if (apar[i])
			continue;

		auto new_v = build_perm(v_sorted, i);
		// v.pop_back();

		if (match(new_v, v, i)) {
			for (auto i : new_v)
				cout << i << ' ';
			cout << '\n';
			return;
		}
	}

	assert(0);	
}

void Transmit()
{
	int n;
	cin >> n;
	vector <int> v(n);
	for (auto & i : v)
		cin >> i;
	sort(v.begin(), v.end());
	v = build_perm(v);

	for (auto i : v)
		cout << i << ' ';
	cout << '\n';
}

int main()
{
	string s;
	int t;
	cin >> s >> t;
	
	while (t--) {
		if (s == "transmit")
			Transmit();
		else
			Recover();
	}
	
	return 0;
}