#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    cout << "? 0 0" << endl;
    int32_t d;
    cin >> d;
    vector<pair<int32_t, int32_t>> cand;
    for (auto a = 0; a <= 100; ++a) {
        for (auto b = 0; b <= 100; ++b) {
            if (a * a + b * b == d) {
                cand.push_back({a, b});
            }
        }
    }
    cout << "? 100 0" << endl;
    cin >> d;
    for (auto &&p : cand) {
        int32_t ta = 100 - p.first, tb = 0 - p.second;
        if (ta * ta + tb * tb == d) {
            cout << "! " << p.first << " " << p.second << endl;
            break;
        }
    }
    return 0;
}