#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
#define endl '\n'
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 1000000007LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#pragma endregion
#define MAX 222222


ll num[MAX];


int main(void) {
  ios::sync_with_stdio(false); cin.tie(0);

  cin >> n >> m;
  ll d2 = 0, d4 = 0, cur = 0;
  bool skip = false, rev = false;
  ok = true;

  rep(i, m) {
    cin >> s;
    if (d2) {
      if (s == "drawtwo") {
        d2++;
        num[cur]++;
        if (!rev) (cur += 1) %= n;
        else (cur = cur + n - 1) %= n;
        continue;
      }
      num[cur] -= 2 * d2;
      d2 = 0;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
    }
    if (d4) {
      if (s == "drawfour") {
        d4++;
        num[cur]++;
        if (!rev) (cur += 1) %= n;
        else (cur = cur + n - 1) %= n;
        continue;
      }
      num[cur] -= 4 * d4;
      d4 = 0;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
    }

    if (s == "number") {
      num[cur]++;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
      continue;
    }

    if (s == "skip") {
      num[cur]++;
      if (!rev) (cur += 2) %= n;
      else (cur = cur + n - 2) %= n;
      continue;
    }

    if (s == "reverse") {
      rev = !rev;
      num[cur]++;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
      continue;
    }

    if (s == "drawtwo") {
      d2++;
      num[cur]++;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
      continue;
    }

    if (s == "drawfour") {
      d4++;
      num[cur]++;
      if (!rev) (cur += 1) %= n;
      else (cur = cur + n - 1) %= n;
      continue;
    }

  }
  if (rev) (cur += 1) %= n;
  else (cur = cur + n - 1) %= n;
  cout << cur + 1 << " " << num[cur] << endl;



  return 0;
}