#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

// long double
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

using P = pair<char, ll>;
// どの文字が長さいくつ
// のvectorで返す
vector<P> run_length(string& s){
  vector<P> ret;
  ll N = s.size();
  if(N==0) return ret;
  char cur=s[0];
  ll cnt=1;
  FOR(i, 1, N){
    if(s[i]==cur){
      cnt++;
    }else{
      ret.push_back(MP(cur, cnt));
      cur = s[i];
      cnt = 1;
    }
  }
  ret.push_back(MP(cur, cnt));  
  return ret;
}

ll N,M;

void f(ll &v){
  v %= N;
  if(v<0) v+=N;
}

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

    // input
    cin>>N>>M;

    VI put(N);
    VI draw(N);

    stringstream ss;
    rep(i,M){
      string s;cin>>s;
      if(s=="number"){
        ss<<'n';
      }
      else if(s=="skip"){
        ss<<'s';
      }
      else if(s=="reverse"){
        ss<<'r';
      }
      else if(s=="drawtwo"){
        ss<<'2';
      }
      else if(s=="drawfour"){
        ss << '4';
      }
    }
    string temp = ss.str();
    debug(temp);
    auto V = run_length(temp);
    // for(auto pa : V){
    //   cout << pa.first << ' ' << pa.second << endl;
    // }

    ll id=0;
    ll prev=0;
    ll sign=1;
    for(auto pa : V){
      char c = pa.first;
      ll cnt = pa.second;
      if(c=='n'){
        rep(i,cnt){
          debug(id, "number");
          put[id]++;
          prev = id;
          id += sign; f(id);
        }
      }
      else if(c=='s'){
        // skip
        rep(i,cnt){
          debug(id, "skip");
          put[id]++;
          prev = id;
          id += 2*sign; f(id);
        }
      }
      else if(c=='r'){
        // reverse
        rep(i,cnt){
          debug(id, "rev");
          put[id]++;
          sign *= -1;
          prev = id;
          id += sign; f(id);
        }
      }
      else if(c=='2'){
        rep(i,cnt){
          debug(id, "draw2");
          put[id]++;
          prev = id;
          id += sign; f(id);
        }
        draw[id] += 2*cnt;
        id += sign; f(id);
      }
      else if(c=='4'){
        rep(i,cnt){
          debug(id, "draw4");
          put[id]++;
          prev = id;
          id += sign; f(id);
        }
        draw[id] += 4*cnt;
        id += sign; f(id);
      }
      debug(prev);
    }

    debug("finished by", prev);

    // 前の人
    //id -= sign; f(id);

    // 最初に持っていた手札の枚数
    ll have = put[prev] - draw[prev];

    p2(prev+1, have);

    return 0;
}