from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    print(0,1,2,3)
    x0,_=MI()
    print(4,5,6,7)
    x1,_=MI()
    ans=[]
    for i in range(4):
        base=[0,1,2,3]
        fin=False
        for a in range(4,10):
            base[i]=a
            print(*base)
            x,_=MI()
            if x<x0:
                ans.append(i)
                fin=True
                break
            if x>x0:
                ans.append(a)
                fin=True
                break
        if fin:continue
        base=[4,5,6,7]
        for a in range(4):
            base[i]=a
            print(*base)
            x,_=MI()
            if x>x1:
                ans.append(a)
                break
    print(*ans)
    input()

main()