#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100

int ask(int x, int y, int z) {
	int d;
	cout << "?" << " " << x << " " << y << " " << z << endl;
	cin >> d;
	cin.ignore();
	return d;
}

void answer(int x, int y, int z) {
	cout << "!" << " " << x << " " << y << " " << z << endl;
}

int main(void) {
	ll lx = -150, ux = 150;
	ll ly = -150, uy = 150;
	ll lz = -150, uz = 150;
	ll ansx, ansy, ansz;
	rep(i, 30) {
		ll ld = ask(lx, 0, 0), ud = ask(ux, 0, 0);
		if (ld < ud)ux = (lx + ux) / 2;
		else lx= (lx + ux) / 2;
	}
	ansx = lx;
	rep(i, 30) {
		ll ld = ask(ansx, ly, 0), ud = ask(ansx, uy, 0);
		if (ld < ud)uy = (ly + uy) / 2;
		else ly = (ly + uy) / 2;
	}
	ansy = ly;
	rep(i, 30) {
		ll ld = ask(ansx, ansy, lz), ud = ask(ansx, ansy, uz);
		if (ld < ud)uz = (lz + uz) / 2;
		else lz = (lz + uz) / 2;
	}
	ansz = lz;
	answer(ansx, ansy, ansz);
	return 0;
}