#include <iostream>
#include <cassert>
#include <ranges>
#include <algorithm>
#include <vector>
using namespace std;
using ll=long long;

#include <atcoder/all>
using mint=atcoder::modint998244353;

ostream& operator<<(ostream& os,mint& x){
	os<<x.val();
	return os;
}
istream& operator>>(istream& is,mint& x){
	int t;
	is>>t;
	x=t;
	return is;
}

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p);
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p);
template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr);
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr);
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec);
template <typename T>
istream& operator>>(istream& is,vector<T>& vec);

template <typename S,typename T>
ostream& operator<<(ostream& os,pair<S,T>& p){
	os<<p.first<<" "<<p.second;
	return os;
}
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p){
	is>>p.first>>p.second;
	return is;
}

template <typename T,size_t n>
ostream& operator<<(ostream& os,array<T,n>& arr){
	for(int i=0;i<n;i++)os<<arr[i]<<(i+1==n?"":" ");
	return os;
}
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr){
	for(int i=0;i<n;i++)is>>arr[i];
	return is;
}
template <typename T>
ostream& operator<<(ostream& os,vector<T>& vec){
	for(int i=0;i<vec.size();i++)os<<vec[i]<<(i+1==vec.size()?"":" ");
	return os;
}
template <typename T>
istream& operator>>(istream& is,vector<T>& vec){
	for(int i=0;i<vec.size();i++)is>>vec[i];
	return is;
}
#include <map>
map<int,ll> mp;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	string player;
	cin>>player;
	int q;
	cin>>q;
	int n,m;
	cin>>n>>m;
	if(player=="Bob"){
		swap(n,m);
	}
	vector<array<ll,2>> x(n);
	for(int i=0;i<n;i++){
		cin>>x[i][0];
		x[i][1]=i;
	}
	ranges::sort(x);
	int l=0,r=n;
	int a=0,b=m;
	while(l+1<r||a+1<b){
		if(q==0){
			ll t=1;
			for(ll i=1;i<=1e15;i++){
				t*=i;
			}
			cout<<t<<endl;
			return 0;
		}
		q--;	
		ll h,c;
		if((r-l>b-a)||(r-l==b-a&&n%2==1)){
			h=(l+r)/2;
			c=(n+m)/2-h;
		}else{
			c=(a+b)/2;
			h=(n+m)/2-c;
		}
		/*
		cout<<l<<" "<<r<<" "<<h<<endl;
		cout<<a<<" "<<b<<" "<<c<<endl;
		//*/
		cout<<"share"<<" "<<x[h][1]+1<<endl;
		ll v;
		cin>>v;
		if((r-l>b-a)||(r-l==b-a&&n%2==1)){
			if(v<=x[h][0]){
				r=h;
				a=c;
			}else{
				l=h;
				b=c;
			}
		}else{
			if(x[h][0]<=v){
				b=c;
				l=h;
			}else{
				a=c;
				r=h;
			}
		}
		mp[c]=v;
	}
	/*
	cout<<l<<" "<<r<<endl;
	cout<<a<<" "<<b<<endl;
	//*/
	cout<<"share "<<x[l][1]+1<<endl;
	ll v;
	cin>>v;
	mp[a]=v;
	int l3=a+1,r3=a+1;
	for(int i=0;i<n;i++){
		if(x[i][0]<mp[a])l3++;
		if(x[i][0]<=mp[a])r3++;
	}
	if(2*l3<=n+m+1&&2*r3>=n+m+1)cout<<"answer "<<mp[a]<<endl;
	else cout<<"answer "<<x[l][0]<<endl;

}