#include <iostream>
#include <cstdlib>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <string.h>
#include <random>
typedef long long ll;
const ll MOD = 1e9 + 7, INF = 1e18;
using namespace std;
ll n, x, y, min_x, max_x, min_y, max_y;
bool query (ll x, ll y)
{
if (x <= 0 || x > n || y <= 0 || y > n) return false;
cout << "examine " << x << ' ' << y << endl;
fflush (stdout);
string s;
cin >> s;
if (s == "true") return true;
else return false;
}
int main ()
{
cin >> n >> x >> y;
max_x = min_x = x;
max_y = min_y = y;
while (query (max_x, y)) max_x++;
while (query (min_x, y)) min_x--;
while (query (x, max_y)) max_y++;
while (query (x, min_y)) min_y--;
min_x++;
max_x--;
min_y++;
max_y--;
ll m = max_x - min_x + 1;
x = (min_x + max_x) / 2;
y = (min_y + max_y) / 2;
ll x_c = x - 2 * m;
ll y_c = y - 2 * m;
if (query (x + 2 * m, y)) x_c += 2 * m;
if (query (x + 4 * m, y)) x_c += 2 * m;
if (query (x, y + 2 * m)) y_c += 2 * m;
if (query (x, y + 4 * m)) y_c += 2 * m;
cout << "solution " << x_c << ' ' << y_c << endl;
fflush (stdout);
}
