#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, m, x[100000];
string s[300001];

int ne(int a, int b) {
	a += b;
	if(a < 0) { a += n; }
	if(a >= n) { a -= n; }
	return a;
}

int main() {
	cin >> n >> m;
	inc(i, m) { cin >> s[i]; }
	s[m] = "----";
	
	vector<char> v;
	inc(i, m) {
		if(s[i] ==   "number") { v.PB('N'); }
		if(s[i] ==  "drawtwo") { v.PB('d'); if(s[i + 1] !=  "drawtwo") { v.PB('-'); } }
		if(s[i] == "drawfour") { v.PB('D'); if(s[i + 1] != "drawfour") { v.PB('-'); } }
		if(s[i] ==     "skip") { v.PB('S'); }
		if(s[i] ==  "reverse") { v.PB('R'); }
	}
	
	// inc(i, v.size()) { cout << v[i]; } cout << endl;
	
	int p = 0, d = +1, z = 0;;
	inc(i, v.size()) {
		// inc(i, n) { cout << -x[i] << " "; } cout << endl;
		
		if(v[i] == '-') { x[p] += z; z = 0; }
		if(v[i] == 'N') { x[p]--; }
		if(v[i] == 'd') { x[p]--; z += 2; }
		if(v[i] == 'D') { x[p]--; z += 4; }
		if(v[i] == 'S') { x[p]--; p = ne(p, d); }
		if(v[i] == 'R') { x[p]--; d *= -1; }
		
		p = ne(p, d);
		
		
	}
	// inc(i, n) { cout << -x[i] << " "; } cout << endl;
	
	p = ne(p, -d);
	cout << p + 1 << " " << -x[p] << endl;
	
	return 0;
}