#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

// 質問クエリ
int ask(int x, int y, int z) {
	int d;
	cout << "?" << " " << x << " " << y << " " << z << endl;
	cin >> d;
	return d;
}

ll query(ll i, ll x){
    vector<ll> A(3);
    A[i] = x;
    return ask(A[0], A[1], A[2]);
}

// 回答クエリ
void answer(int x, int y, int z) {
	cout << "!" << " " << x << " " << y << " " << z << endl;
}

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

    // input
    vector<ll> Ans(3);

    FOR(i, 0, 3){
        ll left = -100;
        ll right = 100;

        while(left+1!=right){
            ll p0 = (2 * left + 1 * right) / 3;
            ll p1 = (1 * left + 2 * right) / 3;

            ll d0 = query(i, p0);
            ll d1 = query(i, p1);

            if(d0<d1){
                right = p1;
            }else{
                left = p0;
            }
        }
        ll d0 = query(i, left);
        ll d1 = query(i, right);
        if(d0<d1){
            Ans[i] = left;
        }else{
            Ans[i] = right;
        }
    }

    answer(Ans[0], Ans[1], Ans[2]);
    
    return 0;
}