#pragma GCC target("avx2") #pragma GCC optimize("03") #pragma GCC optimize("unroll-loops") #include using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; #define endl "\n" #define FOR(i,a,b) for(int i=(a);i<=(b);i++) #define rep(i,n) for(int i=0;i<(n);i++) #define PII pair #define PLL pair #define ALL(x) (x).begin(), (x).end() void flush(){cout<inline bool chmax(T &a, const T &b) { if (ainline bool chmin(T &a, const T &b) { if (binline int popcount(T a) {return __builtin_popcount(a);} templateinline T emod(T a, T p) { return (a%p + p) % p;} //------------------- int ask(int x, int i) { vector v(3, 0); v[i] = x; cout << "?" << " " << v[0] << " " << v[1] << " " << v[2] << endl; int d; cin >> d; return d; } // 回答クエリ void answer(int x, int y, int z) { cout << "!" << " " << x << " " << y << " " << z << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); auto f = [](int i) { int left = -100; int right = 100; while(right-left > 2) { int c1 = left + (right-left)/3; int c2 = right - (right-left)/3; int dc1 = ask(c1, i); int dc2 = ask(c2, i); if(dc1 > dc2) left = c1; else right = c2; } int dist = INF; int ans; for(int x=left; x<=right; x++) { if(chmin(dist, ask(x, i))) ans = x; } return ans; }; vector v(3,0); rep(i,3) { v[i] = f(i); } answer(v[0], v[1], v[2]); return 0; }