#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int N,M,K,a,b,x=INF,y=INF,X=-INF,Y=-INF,n,m;
#define XL (x-n)
#define XR (N-X)
#define YL (y-m)
#define YR (M-Y)
#define XOR (XL^XR^YL^YR)
#define ZZ(S,N) (string(S)+" "+to_string(N))
string mv(){
    int a;
    if((XOR^XL)<XL)return a=XL-(XOR^XL),n+=a,ZZ("top",a);
    if((XOR^XR)<XR)return a=XR-(XOR^XR),N-=a,ZZ("bottom",a);
    if((XOR^YL)<YL)return a=YL-(XOR^YL),m+=a,ZZ("left",a);
    if((XOR^YR)<YR)return a=YR-(XOR^YR),M-=a,ZZ("right",a);
    assert(0);
}
void go(string s){printf("%s\n",s.c_str()),fflush(stdout);}
void _deb(){printf("(%d): [%d,%d] | [%d,%d] | [%d,%d] | [%d,%d]\n",XOR,n,x,X,N,m,y,Y,M);}
char w[666];
int main(void){
    scanf("%d %d %d",&N,&M,&K);
    F(K)scanf("%d%d",&a,&b),x=min(x,a),X=max(X,a),y=min(y,b),Y=max(Y,b);
    --x,--y;
    if(XOR)go(mv());
    else go("pass");
    while(666){
//        _deb();
        scanf("%s",w);
        string s(w);
        if(s=="yuck!")return 0;
        scanf("%d",&a);
        if(s=="top")n+=a;
        else if(s=="bottom")N-=a;
        else if(s=="left")m+=a;
        else if(s=="right")M-=a;
        else assert(0);
        go(mv());
//        go(ZZ("fail",XOR));
    }
    return 0;
}