#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL ask(int x, int y, int z) {
	cout << "?" << " " << x << " " << y << " " << z << endl;
	int d; cin >> d;
	assert(d >= 0);
	return d;
}

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

int main() {
	int a[2][3] = {
		-100, -100, -100,
		+100, +100, +100,
	};
	
	inc(q, 10) {
		LL d = 1LL << 33;
		array<int, 3> ar;
		inc(x, 2) {
		inc(y, 2) {
		inc(z, 2) {
			if(setmin(d, ask(a[x][0], a[y][1], a[z][2]))) {
				ar = { x, y, z };
			}
		}
		}
		}
		inc(i, 3) { a[1 - ar[i]][i] = (a[0][i] + a[1][i]) / 2; }
	}
	
	LL dd = ask(a[0][0], a[0][1], a[0][2]);
	incII(x, -1, +1) {
	incII(y, -1, +1) {
	incII(z, -1, +1) {
		if(x == 0 && y == 0 && z == 0) { continue; }
		assert(dd < ask(a[0][0] + x, a[0][1] + y, a[0][2] + z));
	}
	}
	}
	
	ans(a[0][0], a[0][1], a[0][2]);
	
	return 0;
}