#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 xb = x0+1;
int sp=0, ep=n;
while (xb <= n && ex(xb, y0)) xb++;
xb--;
int xa = x0-1;
while (xa >= 1 && ex(xa, y0)) xa--;
xa++;
int m = xb - xa;
int zx = (xb + xa)/2;
int yb = y0+1;
int ya = y0-1;
while (yb <= n && ex(zx, yb)) yb++;
while (ya >=1 && ex(zx, ya)) ya--;
yb--;
ya++;
int zy = (yb + ya)/2;
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;
}
