#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<class... T>
constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class... T>
constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


int main(){
  ll n,m,q,x;
  st s;
  cin>>s>>q>>n>>m;
  auto v=vec<P>({0},{0,0});
  if(q==1000){
    if(s=="Alice"){
      for(ll i=0;i<n;i++){
        cin>>x;
        v.push_back({x,-1});
      }
      for(ll i=0;i<n;i++){
        cout<<"share "<<i+1<<endl;
        cin>>x;
        v.push_back({x,-1});
      }
    }else{
      for(ll i=0;i<m;i++){
        cin>>x;
        v.push_back({x,-1});
      }
      for(ll i=0;i<m;i++){
        cout<<"share "<<i+1<<endl;
        cin>>x;
        v.push_back({x,-1});
      }
    }
    sort(v.begin(),v.end());
    cout<<"answer "<<v[(n+m)/2].first<<endl;
  }
  ll l=0,r=0,mid=0;
  ll cl=0,cr=0;  //廃棄したもの
  ll al=0,ar=0,amid=0; //相手のlr
  ll shared=0;
  auto w=vec<ll>({0},0);
  if(q==12){
  	return 0; //あわない。。。
    if(s=="Alice"){
      for(ll i=1;i<=n;i++){
        cin>>x;
        v.push_back({x,i});
      }
      sort(v.begin(),v.end());
      l=0,r=n-1;
      al=0,ar=m-1;
      for(ll i=0;i<9;i++){
        mid=(l+r)/2;
        amid=(al+ar)/2;
        cout<<"share "<<v[mid].second<<endl;
        cin>>x;
        shared=mid;
        if(v[mid].first>x){l=mid;ar=amid;cl+=mid-l;cr+=ar-amid;}
        else{r=mid;al=amid;cr+=r-mid;cl+=amid-al;}
      }
      for(ll i=l;i<=r;i++){
        if(i==shared) continue;
        cout<<"share "<<v[i].second<<endl;
        cin>>x;
        w.push_back(x);
        w.push_back(v[i].first);
      }

    }else{
      for(ll i=1;i<=m;i++){
        cin>>x;
        v.push_back({x,i});
      }
      sort(v.begin(),v.end());
      l=0,r=m-1;
      al=0,ar=n-1;
      for(ll i=0;i<9;i++){
        mid=(l+r)/2;
        amid=(al+ar)/2;
        cout<<"share "<<v[mid].second<<endl;
        cin>>x;
        shared=mid;
        if(v[mid].first>x){l=mid;ar=amid;cl+=mid-l;cr+=ar-amid;}
        else{r=mid;al=amid;cr+=r-mid;cl+=amid-al;}
      }
      for(ll i=l;i<=r;i++){
        if(i==shared) continue;
        cout<<"share "<<v[i].second<<endl;
        cin>>x;
        w.push_back(x);
        w.push_back(v[i].first);
      }
    }
    if((n+m)/2-cl>=0) cout<<"answer "<<w[(n+m)/2-cl]<<"\n";
    else{
      cout<<"err"<<"\n";
    }
    cout<<cl<<"\n";
  }
}