#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using ll = long long;
using namespace std;
#define modP 998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

int squareRoot(long long x) {
    int left = 0;
    int right = 1000001;
    int mid;
    while (right - left > 1) {
        mid = (right + left) / 2;
        if ((long long)mid * (long long)mid <= x) {
            left = mid;
        }
        else {
            right = mid;
        }
    }
    return left;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H;cin >> H;
    int W;cin >> W;
    if (H == 1 && W == 1) {
        cout << "! 1 1" << endl;return 0;
    }
    cout << "? 1 1" << endl;
    int d1;cin >> d1;
    if (min(H, W) == 1) {
        if (H == 1) {
            cout << "! 1 " << squareRoot(d1) + 1 << endl;
        }
        else {
            cout << "! " << squareRoot(d1) + 1 << " 1" << endl;
        }
        return 0;
    }
    cout << "? 1 " << W << endl;
    int d2;cin >> d2;
    for (int i = 1;i <= H;i++) {
        for (int j = 1;j <= W;j++) {
            if ((i - 1) * (i - 1) + (j - 1) * (j - 1) == d1 && (i - 1) * (i - 1) + (j - W) * (j - W) == d2) {
                cout << "! " << i << " " << j << endl;
                return 0;
            }
        }
    }
    return 0;
}