#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll query(ll x, ll y, ll z) {
  ll ans;
  cout << "? " << x << " " << y << " " << z << endl;
  cin >> ans;
  return ans;
}

int main(void) {
  ll lx = -150, rx = 150;
  while(lx + 2 < rx) {
    ll x1 = lx + (rx - lx) / 3;
    ll x2 = lx + (rx - lx) * 2 / 3;
    if(query(x1, 0, 0) <= query(x2, 0, 0)) rx = x2;
    else lx = x1;
  }

  ll ly = -150, ry = 150;
  while(ly + 2 < ry) {
    ll y1 = ly + (ry - ly) / 3;
    ll y2 = ly + (ry - ly) * 2 / 3;
    if(query(0, y1, 0) <= query(0, y2, 0)) ry = y2;
    else ly = y1;
  }

  ll lz = -150, rz = 150;
  while(lz + 2 < rz) {
    ll z1 = lz + (rz - lz) / 3;
    ll z2 = lz + (rz - lz) * 2 / 3;
    if(query(0, 0, z1) <= query(0, 0, z2)) rz = z2;
    else lz = z1;
  }

  cout << "! " << (lx + rx) / 2 << " " << (ly + ry) / 2 << " " << (lz + rz) / 2 << endl;
}