#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
const int inv[5] = {0, 1, (Mod+1) / 2, (Mod+1) / 3};
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 1616;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

mt19937_64 rng(58);
typedef array<ull, 10> au10;
au10 val[1000100];
au10 mrg(au10 lh, au10 rh){
	au10 ret;
	rep(i, 10) ret[i] = lh[i] ^ rh[i];
	return ret;
}

int ord[1000100];
const int A = 1000000;

au10 zero;
void check(au10 cur){
	if(cur == zero){
		cout << "0" << endl;
	} else {
		int lb = 1, ub = A;
		while(lb <= ub){
			int mid = (lb+ub) / 2;
			if(val[ord[mid]] >= cur)
				ub = mid-1;
			else
				lb = mid+1;
		}
		if(lb <= A && val[ord[lb]] == cur)
			cout << ord[lb] << endl;
		else
			cout << "-1" << endl;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	for(int i = 1; i <= A; ++i) rep(j, 10) val[i][j] = rng();
	for(int i = 1; i <= A; ++i) ord[i] = i;
	sort(ord + 1, ord + A + 1, [&](int lh, int rh){ return val[lh] < val[rh]; });

	string tp;
	cin >> tp;
	if(tp == "start"){
		int n;
		cin >> n;
		au10 cur = zero;
		while(n--){
			int id;
			cin >> id;
			cur = mrg(cur, val[id]);
			check(cur);
		}
		rep(i, 10) cout << cur[i] << " ";
	} else {
		au10 cur;
		rep(i, 10) cin >> cur[i];
		int n;
		cin >> n;
		while(n--){
			int id;
			cin >> id;
			cur = mrg(cur, val[id]);
			check(cur);
		}
	}

	return 0;
}