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

using ll = long long;
//typedef long long ll;

#define INF (1LL << 31 - 1)
#define INFLL ((1LL << 62) - 1)
#define MOD int(1e9+7)
#define repi(i,j,n) for(int i = (j); i < (n); ++i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) for (int i = n; i >= 0; --i)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()

int vx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, vy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};

inline bool check(int ux, int uy, int x, int y) {
  return (0 <= x and x < ux and 0 <= y and y < uy);
}

inline void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

int bx, ux, by, uy, bz, uz, x, y, z;
ll d, l, r;

inline void answer(int X, int Y, int Z) {
  cout << "!" << " " << X << " " << Y << " " << Z << endl;
}

inline ll query(int X, int Y, int Z) {
  ll ret;
  cout << "?" << " " << X << " " << Y << " " << Z << endl;
  cin >> ret;
  return ret;
}

int main() {
  init();
  bx = by = bz = -150;
  ux = uy = uz = 150;
  x = y = z = INF;

  while (ux - bx > 1) {
    l = query(bx, by, bz);
    r = query(ux, by, bz);

    if (l < r) {
      ux = (bx + ux) / 2;
    }
    else {
      bx = (bx + ux) / 2;
    }
  }

  l = query(bx, by, bz);
  r = query(ux, by, bz);

  if (l < r) x = bx;
  else x = ux;

  while (uy - by > 1) {
    l = query(x, by, bz);
    r = query(x, uy, bz);

    if (l < r) {
      uy = (by + uy) / 2;
    }
    else by = (by + uy) / 2;
  }

  l = query(x, by, bz);
  r = query(x, uy, bz);

  if (l < r) y = by;
  else y = uy;

  while (uz - bz > 1) {
    l = query(x, y, bz);
    r = query(x, y, uz);

    if (l < r) {
      uz = (bz + uz) / 2;
    }
    else bz = (bz + uz) / 2;
  }

  l = query(x, y, bz);
  r = query(x, y, uz);

  if (l < r) z = bz;
  else z = uz;

  answer(x, y, z);

  return 0;
}