#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;

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

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

struct Pos {
    int x,y,z;
    Pos(){};
    Pos(int x,int y,int z):x(x),y(y),z(z){};
};

void solve() {
    int x=0, y=0, z=0;
    int diff = 50;
    REP(i,7) {
        Pos p = Pos(x, y, z);
        int mi = LONG_LONG_MAX;
        FOR(dx,-1,2)FOR(dy,-1,2)FOR(dz,-1,2) {
            Pos tp = Pos(x + dx, y + dy, z + dz);
            int d = ask(tp.x, tp.y, tp.z);
            if (d < mi) {
                mi = d;
                p = tp;
            }
        }
        x = p.x;
        y = p.y;
        z = p.z;
        diff = (diff+1)/2;
    }

    answer(x, y, z);
}