#include <iostream>
//#include<atcoder/all>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> 
#include <vector>
#include <algorithm>
#include <utility> 
#include <tuple> 
#include <cstdint> 
#include <cstdio> 
#include <map> 
#include <queue>
#include <set> 
#include <stack> 
#include <deque> 
#include <unordered_map> 
#include <unordered_set>
#include <bitset> 
#include <cctype>
//using namespace atcoder;
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
vector<bool> seen;
bool C = true;
vector<ll> dist;
ll mod =1e9+7;
int op(int a, int b) {
	return min(a, b);
}
int e() {
	return int(1e9);
}

int main() {
	cout << "? 0 0" << endl;
	ll d1, d2;
	cin >> d1;
	cout << "? 100 100" << endl;
	cin >> d2;
	rep(i, 101)rep(j, 101) {
		if (i * i + j * j == d1&& (i - 100) * (i - 100) + (j - 100) * (j - 100) == d2) {
			cout << "! " << i << " " << j << endl;
			return 0;
		}
	}
}