#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int l = -150, r = 150;
    for(int i = 0; i < 33; ++i){
        int m = (l + r) / 2, p = m / 3, q = m * 2 / 3;
        int d1 = ask(p, 0, 0), d2 = ask(q, 0, 0);
        if(d1 <= d2)    r = q;
        else    l = p;
    }
    int x = l;
    
    l = -150, r = 150;
    for(int i = 0; i < 33; ++i){
        int m = (l + r) / 2, p = m / 3, q = m * 2 / 3;
        int d1 = ask(x, p, 0), d2 = ask(x, q, 0);
        if(d1 <= d2)    r = q;
        else    l = p;
    }
    int y = l;

    l = -150, r = 150;
    for(int i = 0; i < 33; ++i){
        int m = (l + r) / 2, p = m / 3, q = m * 2 / 3;
        int d1 = ask(x, y, p), d2 = ask(x, y, q);
        if(d1 <= d2)    r = q;
        else    l = p;
    }
    int z = l;

    answer(x, y, z);

    return 0;
}