# input
import sys
# input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

p = SI()
q = II()
n, m = MI()
xs = LI()

xi = [(x, i) for i, x in enumerate(xs)]
xi.sort()

if p == "Bob":
    n, m = m, n

"""
自分は長さ n の配列 xs が与えられている

境界がかなり怪しいどうすればいいんだ

考え直しっぽいな

素直に小さい順から探索するほうが筋がいいっぽいど。

回数足りなくて鬱。想定解引かないと回数足りないのしんどい

うーん、、、すこしずるしますか？


"""

k = (n + m) // 2 + 1
nn = 0
mm = 0

for i in range(q):
    if nn == n:
        # 返ってきたのを返す
        x, idx = xi[0]
        print("share", idx + 1)
        v = II()
        print("answer", v)
        exit()
    if mm == m:
        # 答えを返す
        x, idx = xi[nn + k - 1]
        print("share", idx + 1)
        v = II()
        print("answer", x)
        exit()
    if k == 1:
        # x, idx = xi[nn]
        # print("share", idx + 1)
        # v = II()
        print("answer", min(x, v))
        exit()
    
    dn = min(n - nn, k // 2)
    dm = min(m - mm, k // 2)
    
    x, idx = xi[nn + dn - 1]
    print("share", idx + 1)
    v = II()
    
    if x == v:
        print("answer", x)
        exit()
    if x < v:
        nn += dn
        k -= dn
    else:
        mm += dm
        k -= dm