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

#define LL long long
#define LD long double
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define SIZ(c) (int)(c).size()
#define ALL(c) (c).begin(), (c).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define FORD(i, b, e) for (int i = (b); i >= (int)(e); i--)
#define ll LL
#define st f
#define nd s
#define mp MP
#define pb PB
#define eb emplace_back
#define siz(c) SIZ(c)
const int inf = 1e9 + 7;
const LL INF = 1e18L + 7;

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type
{int o = 0; p << "{"; for (auto c : y) {if (o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << "\n";}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if (p > y) p = y;}
sim, class s> void maxi(n &p, s y) {if (p < y) p = y;}

#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif

#define I(x) #x " =", (x), " "

int n, m, k;
map<string, int> st;
map<int, string> it;
int T[5];

void read()
{
	string x;
	cin >> x;
	if (x == "yuck!")
	{
		exit(0);
	}
	int a;
	cin >> a;
	T[st[x]] -= a;
}

void move()
{
	FOR(i, 0, 3)
	{
		int tmp = 0;
		FOR(j, 0, 3)
		{
			if (j != i)
			{
				tmp ^= T[j];
			}
		}
		if (tmp < T[i])
		{
			cout << it[i] << " " << T[i] - tmp << endl;
			T[i] = tmp;
			return;
		}
	}
	assert(false);
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	st["left"] = 0;
	st["right"] = 1;
	st["top"] = 2;
	st["bottom"] = 3;
	it[0] = "left";
	it[1] = "right";
	it[2] = "top";
	it[3] = "bottom";
	cin >> n >> m >> k;
	int minx = inf, maxx = 0, miny = inf, maxy = 0;
	FOR(i, 1, k)
	{
		int x, y;
		cin >> x >> y;
		mini(minx, x);
		maxi(maxx, x);
		mini(miny, y);
		maxi(maxy, y);
	}
	T[0] = miny - 1;
	T[1] = m - maxy;
	T[2] = minx - 1;
	T[3] = n - maxx;
	debug(T[0], T[1], T[2], T[3]);
	if ((T[0] ^ T[1] ^ T[2] ^ T[3]) == 0)
	{
		cout << "pass" << endl;
	}
	else
	{
		move();
	}
	while (true)
	{
		debug(T[0], T[1], T[2], T[3]);
		read();
		move();
	}
}