#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

int X,Y,Z;
int test(vector<int> pos){
	int ret = 0;
	for(int i=0;i<3;++i){
		ret += pos[i]*pos[i];
	}
	return ret;
}
int get(vector<int> pos){
	cout<<"?";
	for(int i=0;i<3;++i){
		cout<<" "<<pos[i];
	}
	cout << endl;
	int ret;
	cin>> ret;
	//ret = test(pos);
	//cout<<ret << endl;
	return ret;
}
void solve(){
	vector<int> ans(3);
	ans[0] = -150;
	ans[1] = -150;
	ans[2] = -150;
	int L,R;
	int fL,fR;
	vector<int> pos(3);
	for(int i=0;i<3;++i){
		pos = ans;
		L = -150;
		R = 150;
		pos[i] = L;
		fL = get(pos);
		pos[i] = R;
		fR = get(pos);
		
		do{
			int midL = (L*2+R)/3;
			int midR = (L+R*2)/3;
			pos[i] = midL;
			int fmidL = get(pos);
			pos[i] = midR;
			int fmidR = get(pos);
			if( fmidL > fmidR ){
				L = midL;
				fL = fmidL;
			}else{//fmidL <= fmidR
				R = midR;
				fR = fmidR;
			}
		}while(R-L>=2);
		if( fR < fL ){
			ans[i] = R;
		}else{
			ans[i] = L;
		}
	}
	cout << "!";
	for(int i=0;i<3;++i){
		cout<<" "<<ans[i];
	}
	cout<<endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()