#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <set>
#include <map>
#include <vector>

using namespace std;
typedef long long LL;


int main() {
	int n, m, r;
	scanf("%d %d %d", &n, &m, &r);
	int mni=n+m, mnj=n+m, mxi=0, mxj=0;
	for (int i = 0; i < r; i++){
		int a,b;
		scanf("%d %d", &a, &b);
		mni = min(mni, a);
		mnj = min(mnj, b); 
		mxi = max(mxi, a); 
		mxj = max(mxj, b); 
	}
	
	int a=mni-1,b=mnj-1,c=n-mxi,d=m-mxj;
	string s;
	int sz;
	
	if ((a^b^c^d)==0) {
		cout<<"pass"<<endl;
		cout.flush();
		cin>>s;
		if (s == "yuck!")
			return 0;
		cin>>sz;
		if (s == "left")
			b -= sz;
		if (s == "top")
			a -= sz;
		if (s == "right")
			d -= sz;
		if (s == "bottom")
			c -= sz;
	}
	
	while ((a^b^c^d) != 0) {
		if ((a^b^c) <= d) {
			cout<<"right "<<d-(a^b^c)<<endl;
			cout.flush();
			d = a^b^c;
		}
		else if ((a^b^d) <= c) {
			cout<<"bottom "<<c-(a^b^d)<<endl;
			cout.flush();
			c = a^b^d;
		}
		else if ((a^c^d) <= b) {
			cout<<"left "<<b-(a^c^d)<<endl;
			cout.flush();
			b = a^c^d;
		}
		else if ((b^c^d) <= a) {
			cout<<"top "<<a-(b^c^d)<<endl;
			cout.flush();
			a = b^c^d;
		}
		else {
			cout<<"ERROR"<<endl;
			cout.flush();
		}
		
		
		
		cin>>s;
		if (s == "yuck!")
			return 0;
		cin>>sz;
		if (s == "left")
			b -= sz;
		if (s == "top")
			a -= sz;
		if (s == "right")
			d -= sz;
		if (s == "bottom")
			c -= sz;
		
	}
		
	
	return 0;
}