#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) 
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int m, n;
string str;

int main() {
    while (cin >> m >> n) {
        if (m == 0) break;
        
        int x = 1, y = 1, dir = 1;
        while (getline(cin,str)) {
            if (str == "STOP") {
                cout << x << " " << y << endl;
                break;
            }
            else if (str == "LEFT") dir = (dir + 1) % 4;
            else if (str == "RIGHT") dir = (dir + 3) % 4;
            else {
                string sub; int num;
                istringstream sin(str);
                sin >> sub >> num;
                if (sub == "FORWARD") {
                    for (int i = 0; i < num; ++i) {
                        int nx = x + dx[dir], ny = y + dy[dir];
                        if (nx <= 0 || nx > m || ny <= 0 || ny > n) break;
                        x = nx, y = ny;
                    }
                }
                else {
                    for (int i = 0; i < num; ++i) {
                        int nx = x - dx[dir], ny = y - dy[dir];
                        if (nx <= 0 || nx > m || ny <= 0 || ny > n) break;
                        x = nx, y = ny;
                    }
                }
            }
        }
    }
    return 0;
}
