#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int ask(int x, int y, int z) {
	int d;
	cout << "?" << " " << x << " " << y << " " << z << endl;
    // d = abs(x) + abs(y) + abs(z) + 80;
	cin >> d;
	return d;
}

void answer(int x, int y, int z) {
	cout << "!" << " " << x << " " << y << " " << z << endl;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int x[3] = {0, 0, 0};

    for(int i=0;i<3;++i){
        int lb = -150, ub = 151;

        while(ub - lb > 2){
            int m1 = (2 * lb + ub) / 3,
                m2 = (lb + 2 * ub) / 3;

            x[i] = m1;
            int d1 = ask(x[0], x[1], x[2]);
            x[i] = m2;
            int d2 = ask(x[0], x[1], x[2]);

            if(d1 < d2){
                ub = m2;
            }else{
                lb = m1;
            }
        }

        x[i] = lb;
        int d1 = ask(x[0], x[1], x[2]);
        x[i] = lb + 1;
        int d2 = ask(x[0], x[1], x[2]);

        if(d1 < d2){
            x[i] = lb;
        }else{
            x[i] = lb + 1;
        }
    }

    answer(x[0], x[1], x[2]);
}