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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

bool ask(int x, LL y) {
	cout << "? " << x << " " << y << endl;
	string res;
	cin >> res;
	return res[0] == 'b';
}

int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);	
	int w;
	LL h;
	cin >> w >> h;
	vector<int> a(w);
	iota(ALL(a), 1);
	mt19937 rng;
	shuffle(ALL(a), rng);
	int bestX = a[0];
	LL bestY = 0;
	for (int i : a) {
		if (bestY < h && ask(i, bestY + 1)) {
			LL l = bestY + 1, r = h + 1;
			while (r - l > 1) {
				LL m = (l + r) / 2;
				if (ask(i, m)) {
					l = m;
				}
				else {
					r = m;
				}
			}
			bestX = i;
			bestY = l;
		}
	}
	cout << "! " << bestX << " " << bestY << endl;
	return 0;
}