#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
template<class T> bool chmin(T& a, T b) { if(a <= b) return 0; a = b; return 1; }
template<class T> bool chmax(T& a, T b) { if(a >= b) return 0; a = b; return 1; }


struct PCG32 {
    using result_type = uint32_t;
    static constexpr result_type min() { return 0; }
    static constexpr result_type max() { return -1; }
    static constexpr uint64_t inc = 0x9AD8D07E252D5108;
    uint64_t state = 0xD9ED8189755F5F93;
    result_type operator()() {
        uint64_t oldstate = state;
        state = oldstate * 6364136223846793005ULL + (inc | 1);
        uint32_t xorshift = ((oldstate >> 18) ^ oldstate) >> 27;
        uint32_t rot = oldstate >> 59;
        return rotr(xorshift, rot);
    }
} rnd;
constexpr ll N = 1e6;
using T = array<uint64_t, 4>;
T operator^(T a, T b) {
    rep(i, 0, 4) a[i] ^= b[i];
    return a;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    vector<T> seed(N);
    for(auto& v : seed) for(auto& x : v) x = (uint64_t)rnd() << 32 | rnd();
    
    map<T, ll> one;
    one[{}] = 0;
    rep(i, 0, N) one[seed[i]] = i + 1;
    
    string type;
    cin >> type;
    T hash = {};
    
    if(type == "resume") {
        for(auto& x : hash) cin >> x;
    }
    
    ll Q;
    cin >> Q;
    
    while(Q--) {
        ll i;
        cin >> i;
        i--;
        hash = hash ^ seed[i];
        
        auto p = one.find(hash);
        
        if(p != one.end()) cout << p->second << '\n';
        else cout << -1 << '\n';
    }
    
    if(type == "start") {
        rep(i, 0, 4) cout << hash[i] << " \n"[i == 3];
    }
}