import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

void main() {
    int query(int x, int y, int z) {
        int d;
        writefln("? %d %d %d", x, y, z);
        stdout.flush();
        scan(d);
        return d;
    }

    int ansx, ansy, ansz;

    int top = 105, btm = -105;

    while (top - btm > 1) {
        int mid = (btm + top) / 2;

        int d1 = query(mid, 0, 0);
        int d2 = query(mid + 1, 0, 0);

        if (d2 - d1 > 0) {
            top = mid;
        }
        else {
            btm = mid;
        }
    }

    ansx = top;

    top = 105, btm = -105;

    while (top - btm > 1) {
        int mid = (btm + top) / 2;

        int d1 = query(0, mid, 0);
        int d2 = query(0, mid + 1, 0);

        if (d2 - d1 > 0) {
            top = mid;
        }
        else {
            btm = mid;
        }
    }

    ansy = top;

    top = 105, btm = -105;

    while (top - btm > 1) {
        int mid = (btm + top) / 2;

        int d1 = query(0, 0, mid);
        int d2 = query(0, 0, mid + 1);

        if (d2 - d1 > 0) {
            top = mid;
        }
        else {
            btm = mid;
        }
    }

    ansz = top;

    writefln("! %d %d %d", ansx, ansy, ansz);
    stdout.flush();
}






void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}