#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int dist(int a,int b,int c,int d,int e){
  int dx=a-c;
  int dy=b-d;
  return dx*dx+dy*dy==e;
}

int main(){
  vector<int> p={0,0,100};
  vector<int> q={0,100,0};
  vector<ll> D(3);
  rep(i,3){
    cout << "? " << p[i] << " " << q[i] << endl;
    cin >> D[i];
  }
  rep(i,101){
    rep(j,101){
      int ok = 1;
      rep(k,3){
        if(!dist(i,j,p[k],q[k],D[k])) ok=0;
      }
      if(ok){
        cout << "! " << i << " " << j << endl;
        return 0;
      }
    }
  }
  return 0;
}