#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() constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1; templateinline 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 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); cout << fixed << setprecision(15); auto fx = [](ld y, ld z) { ld left = -100; ld right = 100; int cnt = 30; while(cnt--) { ld c1 = left + (right-left)/3; ld c2 = right - (right-left)/3; ask((int) c1, (int) y, (int) z); ld dc1, dc2; cin >> dc1; ask((int) c2, (int) y, (int) z); cin >> dc2; if(c1 > c2) left = c1; else right = c2; } return left; }; auto fy = [](ld x, ld z) { ld left = -100; ld right = 100; int cnt = 30; while(cnt--) { ld c1 = left + (right-left)/3; ld c2 = right - (right-left)/3; ask((int) x, (int) c1, (int) z); ld dc1, dc2; cin >> dc1; ask((int) x, (int) c2, (int) z); cin >> dc2; if(c1 > c2) left = c1; else right = c2; } return left; }; auto fz = [](ld x, ld y) { ld left = -100; ld right = 100; int cnt = 30; while(cnt--) { ld c1 = left + (right-left)/3; ld c2 = right - (right-left)/3; ask((int) x, (int) y, (int) c1); ld dc1, dc2; cin >> dc1; ask((int) x, (int) y, (int) c2); cin >> dc2; if(c1 > c2) left = c1; else right = c2; } return left; }; ld x,y,z; x = 0, y = 0, z = 0; x = fx(y,z); y = fy(x,z); z = fz(x,y); answer(x,y,z); return 0; }