#include <bits/stdc++.h>
using namespace std;

using pii = pair<int,int>;
using ll = long long;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)
#define all(v) v.begin(),v.end()
#define debug(x) cerr << #x << " : " << x << endl

template<class T> bool set_min(T &a, const T &b) { return a > b  ? a = b, true : false; }
template<class T> bool set_max(T &a, const T &b) { return a < b  ? a = b, true : false; }
// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; }

const int INF = 1 << 30;
const ll INFL = 1LL << 60;


class Solver {
  public:    
    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;
    }
    void search(int &a, int &b, int &c, int &t) {
        int l = -150, r = 150 + 1;
        while(l + 2 < r) {
            int m1 = l + (r - l) / 3;
            int m2 = l + (r - l) * 2 / 3;
            t = m1;
            int d1 = ask(a, b, c);
            t = m2;
            int d2 = ask(a, b, c);
            if(d1 >= d2) l = m1;
            else r = m2;
            cerr << l << " " << r << endl;
        }
        t = l;
        int mn = l;
        int d = ask(a, b, c);
        while(++l < r) {
            t = l;
            if(set_min(d, ask(a, b, c))) {
                mn = l;
            }
        }
        t = mn;
    }
    bool solve() {
        int x = 0, y = 0, z = 0;
        search(x, y, z, x);
        search(x, y, z, y);
        search(x, y, z, z);
        answer(x, y, z);
        return 0;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Solver s;
    s.solve();
    return 0;
}