#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ex(int x0, int y0) {
cout << "examine " << x0 << ' ' << y0;
cout.flush();
string exp; cin >> exp;
if (exp == "true") return 1;
else return 0;
}
void solve() {
int n, x0, y0;
cin >> n >> x0 >> y0;
int l = x0, r = min(n, x0 + 100);
int xb;
while (l < r) {
int mid = l + (r - l) / 2;
if (ex(mid, y0)) {
l = mid + 1;
} else {
r = mid;
}
}
xb = l-1;
l = 0, r = x0;
int xa;
while (l < r) {
int mid = l + (r - l) / 2;
if (!ex(mid, y0)) {
l = mid + 1;
}else {
r = mid;
}
}
xa = r;
int zx = (xb + xa)/2;
int yb;
l = y0, r= min(n, y0 + 100);
while (l < r) {
int mid = l + (r - l) / 2;
if (ex(zx, mid)) {
l = mid + 1;
} else {
r = mid;
}
}
yb = l-1;
l = 0, r = y0;
int ya;
while (l < r) {
int mid = l + (r - l) / 2;
if (!ex(zx, mid)) {
l = mid + 1;
}else {
r = mid;
}
}
ya = r;
int zy = (yb + ya)/2;
int m = xb - xa;
set<pair<int, int>> ans;
for (int k=1; k<=4; k++) {
if (ex(zx + k*(2*m - 1), zy)) ans.insert({zx + k*(2*m - 1), zy});
if (ex(zx , zy+ k*(2*m - 1))) ans.insert({zx , zy+ k*(2*m - 1)});
}
for (int k=0; k<=4; k++) {
for (int kk=0; kk<=4; kk++) {
if (ex(zx + k*(m-1), zy + kk*(m-1))) ans.insert({zx + k*(m-1), zy + kk*(m-1)});
}
}
cout << n << ' ' << m << endl;
cout.flush();
cout << x0 << ' ' << y0 << endl;
cout.flush();
int te =1;
for (auto i : ans) {
if (te == 7) {
cout << i.first << ' ' << i.second << endl;
cout.flush();
}
te++;
}
}
signed main() {
int t = 1;
while (t--) solve();
return 0;
}
