/**
	author:  shobonvip
	created: 2025.01.25 23:56:56
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

// [floor_sqrt(N)]
// 0 <= N <= 9e18
long long floor_sqrt(long long N) {
	long long ub = 3'000'000'001;
	long long lb = 0;
	while (ub - lb > 1) {
		long long t = (ub + lb) / 2;
		if (t * t <= N) lb = t;
		else ub = t;
	}
	return lb;
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int h, w; cin >> h >> w;
	if (h == 1 && w == 1) {
		cout << "! 1 1" << endl;
		return 0;
	}
	if (h == 1 || w == 1) {
		cout << "? 1 1" << endl;
		ll a; cin >> a;
		ll r = floor_sqrt(a);
		ll x = 1, y = 1;
		if (h == 1) y += r;
		else x += r;
		cout << "! " << x << ' ' << y << endl;
		return 0;
	}
	cout << "? 1 1" << endl;
	ll a; cin >> a;
	cout << "? 1 2" << endl;
	ll b; cin >> b;
	cout << "? 2 1" << endl;
	ll c; cin >> c;
	
	ll p = (+1+(a-b)) / 2;
	ll q = (+1+(a-c)) / 2;
	cout << "! " << 1 + q << " " << 1 + p << endl;

}