#include <bits/stdc++.h>

using namespace std;

#define fio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

typedef long long ll;

int up,down,left,right,num;
string s;
map<string,int> m;
vector<string> dirs = {"top","bottom","left","right"};

int grundy(){
    int res = 0;
    for (string d : dirs)
        res ^= m[d];
    return res;
}

void update(){
    m[s] -= num;
}

void move(){
    s = "";
    int g = grundy();
    for (int i = 31; i >= 0; i--){
        if (!(g&(1<<i)))
            continue;
        for (string d : dirs){
            if (m[d]&(1<<i)){
                s = d;
                num = i;
            }
        }
        if (s != "")
            break;
    }
    int xord = grundy();
    xord ^= m[s];
    cout << s << " " << m[s]-xord << endl;
    cout.flush();
    m[s] = xord;
}

int main() { fio
    int r,c,k;
    cin >> r >> c >> k;
    vector<pair<int,int>> a(k);
    for (int i = 0; i < k; i++){
        cin >> a[i].first >> a[i].second;
    }
    sort(a.begin(),a.end());
    m["top"] = a[0].first-1;
    m["bottom"] = r-a.back().first;
    m["left"] = a[0].second-1;
    m["right"] = c-a.back().second;
    s = "aaaa";
    if (grundy() == 0){
        cout << "pass" << endl;
        cout.flush();
        cin >> s;
        if (s == "yuck!")
            return 0;
        cin >> num;
        update();
    }
    while (s != "yuck!"){
        move();
        cin >> s;
        if (s == "yuck!")
            return 0;
        cin >> num;
        update();
    }
    return 0;
}