#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod= 1e10;

void answer(int *a){
    printf("! %d %d %d\n", a[0], a[1], a[2]);
    fflush(stdout);
}

int ask(int *a){
    printf("? %d %d %d\n", a[0], a[1], a[2]);
    fflush(stdout);
    int d;
    scanf("%d", &d);
    return d;
}

void calc(int *a, int p){
    int lb = -100, ub = 101;
    while(ub-lb>5){
        int lb2 = (2*lb+ub)/3;
        a[p] = lb2;
        int l = ask(a);
        int ub2 = (lb+2*ub)/3;
        a[p] = ub2;
        int r = ask(a);
        if(l<r) ub = ub2;
        else lb = lb2;
    }
    a[p] = lb;
    int x = ask(a);
    while(true){
        a[p]++;
        int y = ask(a);
        if(y<x){
            x = y;
            continue;
        }
        --a[p];
        return;
    }
}

int main(){
    int a[3] = {0, 0, 0};
    REP(i,0, 3) calc(a, i);
    answer(a);
    return 0;
}