#include <bits/stdc++.h> using namespace std; #define fst(t) std::get<0>(t) #define snd(t) std::get<1>(t) #define thd(t) std::get<2>(t) #define unless(p) if(!(p)) #define until(p) while(!(p)) using ll = long long; using P = std::tuple<int,int>; const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; int N, M; int cnt[100100]; int ls[300100]; int main(){ std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cin >> N >> M; for(int i=0;i<M;++i){ std::string S; std::cin >> S; if(S == "number"){ ls[i] = 0; }else if(S == "drawtwo"){ ls[i] = 1; }else if(S == "drawfour"){ ls[i] = 2; }else if(S == "skip"){ ls[i] = 3; }else{ ls[i] = 4; } } int cur = 0, prv = -1, dir = +1; for(int i=0;i<M;){ // std::cout << (cur + 1) << std::endl; prv = cur; if(1 <= ls[i] && ls[i] <= 2){ // drawtwo, drawfour int j = i, n = 0; while(j < M && ls[j] == ls[i]){ cnt[cur] += 1; n += ls[j] * 2; j += 1; cur = (cur + N + dir) % N; } cnt[cur] -= n; cur = (cur + N + dir) % N; i = j; }else{ cnt[cur] += 1; if(ls[i] == 0){ // number cur = (cur + N + dir) % N; }else if(ls[i] == 3){ // skip cur = (cur + N + dir * 2) % N; }else{ // reverse dir = -dir; cur = (cur + N + dir) % N; } i += 1; } } std::cout << (prv + 1) << " " << cnt[prv] << std::endl; }