#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if (p != -1) { x %= p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; void solve() { int n,m; cin>>n>>m; int cur=0; int add=0; int draw2=0,draw4=0; vectornum(n); auto func=[](int n,int add,int &cur)->void{ if(!add)cur++; else cur--; cur=(cur+n)%n; }; rep(i,m){ string s; cin>>s; if(draw2>0&&s!="drawtwo"){ num[cur]-=draw2; draw2=0; func(n,add,cur); } else if(draw4>0&&s!="drawfour"){ num[cur]-=draw4; draw4=0; func(n,add,cur); } num[cur]++; if(draw2>0){ if(s=="drawtwo")draw2+=2; }else if(draw4>0){ if(s=="drawfour")draw4+=4; } if(s=="drawtwo")draw2+=2; else if(s=="drawfour")draw4+=4; else if(s=="reverse")add^=1; else if(s=="skip"){ if(i