#include #define show(x) cerr << #x << " = " << x << endl using namespace std; using ll = long long; template ostream& operator<<(ostream& os, const vector& v) { os << "sz:" << v.size() << "\n["; for (const auto& p : v) { os << p << ","; } os << "]\n"; return os; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } constexpr ll MOD = (ll)1e9 + 7LL; template constexpr T INF = numeric_limits::max() / 64; ll ans[3]; ll ask(const int x, const int y, const int z) { static int q = 0; q++; if (q == 201) { cerr << "feuwfhiwf" << endl; } cout << "? " << x << " " << y << " " << z << endl; ll i; cin >> i; // return (ans[0] - x) * (ans[0] - x) + (ans[1] - y) * (ans[1] - y) + (ans[2] - z) * (ans[2] - z); return i; } int main() { // for (int i = 0; i < 3; i++) { // cin >> ans[i]; // } vector sup(3, 150); vector inf(3, -150); for (int i = 0; i < 3; i++) { while (inf[i] < sup[i]) { const ll ainf = (i == 0) ? ask(inf[i], 0, 0) : (i == 1) ? ask(0, inf[i], 0) : ask(0, 0, inf[i]); const ll asup = (i == 0) ? ask(sup[i], 0, 0) : (i == 1) ? ask(0, sup[i], 0) : ask(0, 0, sup[i]); if (asup == ainf) { inf[i] = (inf[i] + sup[i]) / 2; sup[i] = inf[i]; } else if (asup < ainf) { inf[i] = (inf[i] + sup[i]) / 2; } else { sup[i] = (inf[i] + sup[i] + 1) / 2; } } } cout << "!"; for (int i = 0; i < 3; i++) { cout << " " << inf[i]; } cout << endl; return 0; }