#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
map<pair<int, pair<int, int> >, int> mp;
int ask(int x, int y, int z) {
	int d;
	if (mp.count(make_pair(x, make_pair(y, z))) == 0) {
		cout << "?" << " " << x << " " << y << " " << z << endl;
		cin >> d;
		mp[make_pair(x, make_pair(y, z))] = d;
	}
	else {
		d = mp[make_pair(x, make_pair(y, z))];
	}
	return d;
}

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

signed main(void) {
	int a[3] = { 0, 0, 0 };
	int ans[3] = { 0, 0, 0 };
	int k;
	int u, d, m1, m2;
	int mn;

	int us, ds, ms1, ms2;
	int t;
	u = 100;
	d = -100;
	us = ask(u, a[1], a[2]);
	ds = ask(d, a[1], a[2]);
	//ms = ask(m, a[1], a[2]);
	while (u - d > 5) {
		m1 = (((u + 2 * d)) / 3);
		m2 = (((2 * u + d)) / 3);
		ms1 = ask(m1, a[1], a[2]);
		ms2 = ask(m2, a[1], a[2]);
		if (ms1 < ms2) {
			u = m2;
			us = ms2;
		}
		else {
			d = m1;
			ds = ms1;
		}
	}
	mn = (int)1 << 60;
	for (int i = d; i <= u; i++) {
		t = ask(i, a[1], a[2]);
		if (mn > t) {
			mn = t;
			ans[0] = i;
		}
	}
	u = 100;
	d = -100;
	us = ask(a[0], u, a[2]);
	ds = ask(a[0], d, a[2]);
	//ms = ask(m, a[1], a[2]);
	while (u - d > 5) {
		m1 = (((u + 2 * d)) / 3);
		m2 = (((2 * u + d)) / 3);
		ms1 = ask(a[0], m1, a[2]);
		ms2 = ask(a[0], m2, a[2]);
		if (ms1 < ms2) {
			u = m2;
			us = ms2;
		}
		else {
			d = m1;
			ds = ms1;
		}
	}
	mn = (int)1 << 60;
	for (int i = d; i <= u; i++) {
		t = ask(a[0], i, a[2]);
		if (mn > t) {
			mn = t;
			ans[1] = i;
		}
	}
	u = 100;
	d = -100;
	us = ask(a[0], a[1], u);
	ds = ask(a[0], a[1], d);
	//ms = ask(m, a[1], a[2]);
	while (u - d > 5) {
		m1 = (((u + 2 * d)) / 3);
		m2 = (((2 * u + d)) / 3);
		ms1 = ask(a[0], a[1], m1);
		ms2 = ask(a[0], a[1], m2);
		if (ms1 < ms2) {
			u = m2;
			us = ms2;
		}
		else {
			d = m1;
			ds = ms1;
		}
	}
	mn = (int)1 << 60;
	for (int i = d; i <= u; i++) {
		t = ask(a[0], a[1], i);
		if (mn > t) {
			mn = t;
			ans[2] = i;
		}
	}
	answer(ans[0], ans[1], ans[2]);
	return 0;
}