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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    string s; cin >> s;
    int Q; cin >> Q;
    int N,M; cin >> N >> M;
    if(s == "Bob") swap(N,M);
    vector<pair<int,int>> X(N);
    int idx = 0;
    for(auto &[x,p] : X) cin >> x,p = idx++;
    sort(X.begin(),X.end());

    auto share = [&](int pos) -> int {
        if(Q == 0) exit(0);
        assert(Q > 0),Q--;

        cout << "share " << pos+1 << endl;
        int ret; cin >> ret;
        if(ret == -1) assert(false);
        return ret;
    };
    auto answer = [&](int x) -> void {cout << "answer " << x << endl; exit(0);};

    int low = share(X.at(0).second),high = share(X.back().second);
    if(low == high && X.at(0).first == X.back().first){
        if(N > M) answer(X.at(0).first);
        else answer(low);
    }
    else if(low == high){
        for(int i=0; i<M; i++) X.push_back({low,-1});
        sort(X.begin(),X.end());
        auto [x,pos] = X.at((N+M)/2);
        if(pos == -1) share(X.at(0).second),share(X.back().second);
        else share(pos),share(pos); 
        answer(x);
    }
    else if(X.at(0).first == X.back().first){
        auto v1 = share(0),v2 = share(0);
        if(v1 == v2) answer(v1);
        else answer(X.at(0).first);
    }
    else{
        int l1 = 0,r1 = N,l2 = 0,r2 = M;
        int up = 0,down = 0,dec = (N+M)/2;
        while(true){
            int len1 = r1-l1,len2 = r2-l2;
            if(up+len2 < dec){
                int del = dec-(up+len2);
                r1 -= del,len1 -= del;
            }
            if(down+len2 < dec){
                int del = dec-(down+len2);
                l1 += del,len1 -= del;
            }
            if(up+len1 < dec){
                int del = dec-(up+len1);
                r2 -= del,len2 -= del;
            }
            if(down+len1 < dec){
                int del = dec-(down+len1);
                l2 += del,len2 -= del;
            }
            if(len1 <= 2 && len2 <= 2){
                vector<int> V;
                for(int i=l1; i<r1; i++) V.push_back(X.at(i).first);
                for(int i=l2; i<r2; i++){
                    if(l2 == i) V.push_back(share(X.at(l1).second));
                    else V.push_back(share(X.at(r1-1).second));
                }
                if(len2 == 1) share(X.at(r1-1).second);
                sort(V.begin(),V.end());
                while(up < dec) V.pop_back(),up++;
                answer(V.back());
                break;
            }
            int m1 = (l1+r1)/2,m2 = (l2+r2)/2;
            int v1 = X.at(m1).first,v2 = share(X.at(m1).second);
            if(v1 >= v2){
                int u = r1-m1-1,d = m2-l2;
                up += u,len1 -= u,r1 -= u;
                down += d,len2 -= d,l2 += d;
            }
            else{
                int u = r2-m2-1,d = m1-l1;
                up += u,len2 -= u,r2 -= u;
                down += d,len1 -= d,l1 += d;
            }
        }
    }
}