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

void Alice(bool is_Bob){
    int Q, n, m;
    cin >> Q >> n >> m;
    if(is_Bob) swap(n, m);
    vector<pair<int,int>> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    int mx = max(n, m), k = (n + m + 1) / 2, v, cur = 0;
    int ops = 0;
    for(int i = 0; i + 1 < Q; i++){
        int d2 = k / 2, pos = min(n, d2);
        cout << "share " << a[min(n, d2) - 1].second + 1 << endl;
        cin >> v;
        if(is_Bob == false){
            if(a[pos].first <= v){
                cur += pos;
                k -= pos;
            }else{
                ops += min(m, d2);
                k -= min(m, d2);
            }
        }else{
            if(a[pos].first < v){
                cur += pos;
                k -= pos;
            }else{
                ops += min(m, d2);
                k -= min(m, d2);
            }
        }
        if(cur == n || ops == m) break;
        if(k == 1) break;
    }
    if(cur == n || ops == m){
        if(cur == n){
            cout << "share " << a[n - 1].second + 1 << endl;
            cin >> v;
            cout << "answer " << v << endl;
        }else{
            cout << "share " << a[k - 1].second + 1 << endl;
            cin >> v;
            cout << "answer " << a[k - 1].first << endl;
        }
    }else{
        cout << "share " << a[k - 1].second + 1 << endl;
        cin >> v;
        cout << "answer " << min(v, a[k - 1].first) << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string player;
    cin >> player;
    if(player == "Alice") Alice(false);
    else Alice(true);
}