import sys
sys.setrecursionlimit(10 ** 6)
from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np

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)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def question(i,a):
        if memo[a]!=-1:return memo[a]
        xyz=[0,0,0]
        xyz[i]=a
        print("?",end=" ")
        print(*xyz)
        memo[a]=res=II()
        return res

    ans=[0]*3
    for i in range(3):
        memo = [-1]*205
        l=-101
        r=101
        while l+2<r:
            cl=(2*l+r)//3
            cr=(l+2*r)//3
            dl=question(i,cl)
            dr=question(i,cr)
            if dl<dr:r=cr
            else:l=cl
        c=(l+r)//2
        dl=question(i,l)
        dc=question(i,c)
        dr=question(i,r)
        mn=min(dl,dc,dr)
        if mn==dl:ans[i]=l
        if mn==dc:ans[i]=c
        if mn==dr:ans[i]=r
    print("!",end=" ")
    print(*ans)

main()