#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second

void sol(vector<pair<int,string> >&x) {
    int v = 0;
    sort(x.begin(),x.end());
    for(int i=0;i<4;i++)
        v ^= x[i].st;
    
   for(int i=0;i<4;i++) {
       if((x[i].st ^ v) < x[i].st) {
           cout<<x[i].nd<<" "<<(x[i].st - (x[i].st^v))<<endl;
           x[i].st ^= v;
           break;
       }
   }
}

int main() {
    ios::sync_with_stdio(false);
    int n,m,k;
    cin >> n >> m >> k;
    int minN = 1e9, minM = 1e9, maxN = 0, maxM = 0;
    for(int i=0;i<k;i++) {
        int x,y;
        cin >> x >> y;
        minN = min(minN,x);
        minM = min(minM,y);
        maxN = max(maxN,x);
        maxM = max(maxM,y);
    }
    vector<pair<int,string> > x;
    x.push_back({minN-1,"top"});
    x.push_back({n-maxN,"bottom"});
    x.push_back({minM-1,"left"});
    x.push_back({m-maxM,"right"});

    int v = 0;
    for(int i=0;i<4;i++) {
        v ^= x[i].st;
    }

    if(v == 0)
        cout<<"pass"<<endl;
    else {
        sol(x);
    }

    for(;;) {
        string str;
        cin >> str;
        if(str[0] == 'y') {
            return 0;
        }
        cin >> v;
        for(int i=0;i<4;i++) {
            if(x[i].nd[0] == str[0]) {
                x[i].st -= v;
                break;
            }
        }
        sol(x);
    }
}