def int_ternary_search(f, lo: int, hi: int) -> int:
    l = lo
    r = hi
    while r - l > 3:
        m1 = l + (r - l) // 3
        m2 = r - (r - l) // 3
        if f(m1) > f(m2):
            l = m1
        else:
            r = m2

    ind = l
    best = f(l)
    for i in range(l, r+1):
        v = f(i)
        if v < best:
            best = v
            ind = i

    return ind


def query(x, y, z):
    print(f'? {x} {y} {z}')
    res = int(input())
    return res


def f(p):
    def func(v):
        a = [0, 0, 0]
        a[p] = v
        return query(*a)

    return func


mi = -100
ma = 100
x = int_ternary_search(f(0), mi, ma)
y = int_ternary_search(f(1), mi, ma)
z = int_ternary_search(f(2), mi, ma)
print(f'! {x} {y} {z}')