# 部分点解法

def share(k):
    print("share", k + 1)
    return int(input())


def answer(v):
    print("answer", v)


player = input()
Q = int(input())

assert Q == 1000

N, M = [int(s) for s in input().split()]

size = N if player == "Alice" else M
other = M if player == "Alice" else N
X = [int(s) for s in input().split()]

values = X[:]

for i in range(max(N, M)):
    v = share(i % size)
    if i < other:
        values.append(v)

values.sort()
answer(values[len(values) // 2])