#define _USE_MATH_DEFINES
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<set>
#define ll long long
#define dou(s) atof(s.c_str())
#define lon(s) atoll(s.c_str())
#define str(n) to_string(n)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(ll i=b;i>=a;i--)
#define ALL(a) a.begin(),a.end()
#define rALL(a) a.rbegin(),a.rend()
#define fion(n) fixed<<setprecision(n)
#define endl "\n"
#define OR ||
#define AND &&
#define NOT !
#define line(s) getline(cin,s)
#define MOD 1000000007ll
#define START int main(){cin.tie(0);ios::sync_with_stdio(false);
#define END }
using namespace std;
START
ll n,m;cin>>n>>m;
vector<ll> a(n+1,0);
ll id=1;
bool b=true;
string s,nes;
cin>>s;
ll k=0;
rep(i,0,m-1){
	cin>>nes;
	a[id]--;
	if(s[0]=='r'){
		b=(b+1)%2;
		id+=b*2-1;
	}
	else if(s[0]=='s'){
  	id+=b*4-2;
  }
	else if(s[4]=='t'){
		if(nes[4]=='t'){
			id+=b*2-1;
			k+=2;
		}
		else{
			a[id+b*2-1]+=k+2;
			id+=b*4-2;
			k=0;
		}
	}else if(s[4]=='f'){
		if(nes[4]=='f'){
			id+=b*2-1;
			k+=4;
		}
		else{
			a[id+b*2-1]+=k+4;
			id+=b*4-2;
			k=0;
		}
	}else{
		id+=b*2-1;
	}
	if(id>n)id-=n;else if(id<1)id+=n;
	s=nes;
}
cout<<id<<' '<<1-a[id]<<endl;
END