#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	auto query = [](int X, int Y, int Z) -> int {
		printf("? %d %d %d\n", X, Y, Z);
		fflush(stdout);
		int D;
		scanf("%d", &D);
		if (D == -1) assert(false);
		return D;
	};
	
	int l[3] {}, r[3] {};
	REP(i, 3) {
		l[i] = -102;
		r[i] = 102;
		int lv = -1, rv = -1;
		auto q = [&](int x) {
			int arg[3];
			REP(j, 3) arg[j] = i == j ? x : l[j];
			return query(arg[0], arg[1], arg[2]);
		};
		while (r[i] - l[i] > 2) {
			const int m1 = (2 * l[i] + r[i]) / 3, m2 = (l[i] + 2 * r[i]) / 3;
			const int y1 = q(m1), y2 = q(m2);
			if (y1 < y2) r[i] = m2, rv = y2;
			else l[i] = m1, lv = y1;
		}
		if (r[i] - l[i] == 1 && lv > rv) swap(l[i], r[i]);
		else {
			int m = (l[i] + r[i]) / 2;
			int y = q(m);
			if (y > lv) m = l[i], y = lv;
			if (y > rv) m = r[i], y = rv;
			l[i] = m;
		}
	}
	
	printf("! %d %d %d\n", l[0], l[1], l[2]);
}