import sys

def intersect(v1, v2):

i1 = 0
i2 = 0
intersection = []
while i1 < len(v1) and i2 < len(v2):
if v1[i1] == v2[i2]:
intersection.append(v1[i1])
i1 += 1
i2 += 1

elif v1[i1] < v2[i2]:

i1 += 1
else:
i2 += 1
return intersection

def solve_test(test_no):
pos_ans = []
for i in range(7):
for _ in range(18):
print(18 - i, end = ' ')
print()
sys.stdout.flush()

line = input()
v = [int(x) for x in line.split()]
sum = 0
for x in v:
sum += x

aux = [x for x in range(sum, 1000001, 18 - i)]

pos_ans.append(aux)

all_intersection = intersect(pos_ans[0], pos_ans[1])

for i in range(2, 7):
all_intersection = intersect(all_intersection, pos_ans[i])

if len(all_intersection) != 1:
raise ValueError("bad")

print(all_intersection[0])
sys.stdout.flush()

line = input()
if line == '-1':
sys.exit(0)

line = input()
t, n, m = (int(x) for x in line.split())
for i in range(t):
solve_test(i+1)