#include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <cstring> #include <map> #include <queue> #include <cmath> #include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3 using namespace std; #define MOD 1000000007 #define ll long long #define ld long double #define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++) #define rep(i,n) FOR(i,0,n) #define pb push_back #define mp make_pair #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end()) #define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;} template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();} // 質問クエリ int ask(int x, int y, int z) { int d; cout << "?" << " " << x << " " << y << " " << z << endl; cin >> d; return d; } // 回答クエリ void answer(int x, int y, int z) { cout << "!" << " " << x << " " << y << " " << z << endl; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int minx = -150, maxx = 150; int miny = -150, maxy = 150; int minz = -150, maxz = 150; int x=-150,y=-150,z=-150; //xについて while(minx<maxx){ int left = minx, middle = (minx+maxx)/2, right = maxx; ll ansl, ansr; ansl = ask((left+middle)/2,y,z); ansr = ask((middle+right)/2,y,z); if(ansl<ansr) maxx = middle; else minx = middle; if (ansl==ansr) break; } x = minx; //yについて while(miny<maxy){ int left = miny, middle = (miny+maxy)/2, right = maxy; ll ansl, ansr; ansl = ask(x,(left+middle)/2,z); ansr = ask(x,(middle+right)/2,z); if(ansl<ansr) maxy = middle; else miny = middle; if (ansl==ansr) break; } y = miny; //zについて while(minz<maxz){ int left = minz, middle = (minz+maxz)/2, right = maxz; ll ansl, ansr; ansl = ask(x,y,(left+middle)/2); ansr = ask(x,y,(middle+right)/2); if(ansl<ansr) maxz = middle; else minz = middle; if (ansl==ansr) break; } z = minz; answer(x,y,z); //cout << fixed << setprecision(16) << ans << endl; return 0; }