#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
map<pii, bool>m;
bool ask(int x, int y){
if(m.count(mp(x,y))){
return m[mp(x,y)];
}
else{
cout<<"examine "<<x<<' '<<y<<endl;
string a;
cin>>a;
m[mp(x,y)] = (a == "true");
return (a == "true");
}
}
void answer(int x, int y){
cout<<"solution "<<x<<' '<<y<<endl;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
in3(n,x,y);
int l = x;
int r = n;
while(l < r){
int mid = l + (r - l + 1) / 2;
bool b = ask(mid, y);
if(!b){
r = mid - 1;
}
else{
int m2 = (x + mid) / 2;
b = ask((x + mid) / 2, y);
if(!b){
r = (x + mid) / 2 - 1;
}
else{
b = ask((x + m2) / 2, y);
if(!b){
r = (x + m2) / 2 - 1;
}
else{
l = mid;
}
}
}
}
int rx = l;
//cout<<"RX is "<<rx<<'\n';
l = 1;
r = x;
while(l < r){
int mid = (l + r) / 2;
bool b = ask(mid, y);
if(!b){
l = mid + 1;
}
else{
int m2 = (x + mid) / 2;
b = ask((x + mid) / 2, y);
if(!b){
l = (x + mid) / 2 + 1;
}
else{
b = ask((x + m2) / 2, y);
if(!b){
l = (x + m2) / 2 + 1;
}
else{
r = mid;
}
}
}
}
int lx = l;
//cout<<"LX is "<<lx<<'\n';
int m = (rx - lx + 1);
int lo = y;
int hi = min(n, y + m);
while(lo < hi){
int mid = lo + (hi - lo + 1) / 2;
bool b = ask(x, mid);
if(b){
lo = mid;
}
else{
hi = mid - 1;
}
}
int ry = lo;
//cout<<"RY is "<<ry<<'\n';
l = max(0LL, y-m);
r = y;
while(l < r){
int mid = (l + r) / 2;
bool b = ask(x, mid);
if(b){
r = mid;
}
else{
l = mid + 1;
}
}
int ly = l;
//cout<<"LY is "<<ly<<'\n';
/*
int lx = x;
int rx = x;
int cur = x-1;
while(cur > 0){
bool b = ask(cur, y);
if(b){
lx = cur;
cur--;
}
else break;
}
cur = x+1;
while(cur <= n){
bool b = ask(cur, y);
if(b){
rx = cur;
cur++;
}
else break;
}
int ly = y;
int ry = y;
cur = y-1;
while(cur > 0){
bool b = ask(x, cur);
if(b){
ly = cur;
cur--;
}
else break;
}
cur = y+1;
while(cur <= n){
bool b = ask(x, cur);
if(b){
ry = cur;
cur++;
}
else break;
}
*/
pii mid = mp((lx + rx) / 2, (ly + ry) / 2);
lx = mid.first;
rx = mid.first;
int cur = mid.first-m*2;
while(cur > 0){
bool b = ask(cur, mid.second);
if(b){
lx = cur;
cur-=m*2;
}
else break;
}
cur = mid.first+m*2;
while(cur <= n){
bool b = ask(cur, mid.second);
if(b){
rx = cur;
cur+=m*2;
}
else break;
}
ly = mid.second;
ry = mid.second;
cur = mid.second-m*2;
while(cur > 0){
bool b = ask(mid.first, cur);
if(b){
ly = cur;
cur-=m*2;
}
else break;
}
cur = mid.second+m*2;
while(cur <= n){
bool b = ask(mid.first, cur);
if(b){
ry = cur;
cur+=m*2;
}
else break;
}
answer((lx + rx) / 2, (ly + ry) / 2);
}
