#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int xx=12,yy=-78,zz=99;
// 質問クエリ
int ask(int x, int y, int z) {
	x-=200; y-=200; z-=200;
	int d;
/*	int X = (x-xx)*(x-xx)+(y-yy)*(y-yy)+(z-zz)*(z-zz);
	return X;*/
	cout << "?" << " " << x << " " << y << " " << z << endl;
	cin >> d;
	return d;
}

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

void calc(int xa,int xb,int ya,int yb,int za,int zb){
	if(xa == xb && ya == yb && za == zb){
		answer(xa,ya,za); return;
	}
	//cout<<xa<<xb<<ya<<yb<<za<<zb<<endl;
	if(za != zb){
		int mid = (za+zb)/2;
		int V = ask(xa,ya,mid);
		int VV = ask(xa,ya,mid+1);
		if(V < VV) return calc(xa,xb,ya,yb,za,mid);
		else return calc(xa,xb,ya,yb,mid+1,zb);
	}
	if(ya != yb){
		int mid = (ya+yb)/2;
		int V = ask(xa,mid,za);
		int VV = ask(xa,mid+1,za);
		if(V < VV) return calc(xa,xb,ya,mid,za,zb);
		else return calc(xa,xb,mid+1,yb,za,zb);
	}
	{
		int mid = (xa+xb)/2;
		int V = ask(mid,ya,za);
		int VV = ask(mid+1,ya,za);
		if(V < VV) return calc(xa,mid,ya,yb,za,zb);
		else return calc(mid+1,xb,ya,yb,za,zb);
	}
}
int main(void) {
	calc(-100+200,100+200,-100+200,100+200,-100+200,100+200);
	return 0;
}