import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect
import random

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


def generate(k):
    return random.sample(range(26), k)


N, M = map(int, input().split())


def next():
    global id
    if reverse is True:
        id = (id - 1) % N
    else:
        id = (id + 1) % N


id = 0
reverse = False
cnt = [0] * N
acc2 = 0
acc4 = 0
for i in range(M):
    l = input()[:-1]
    if acc2 > 0 and l != 'drawtwo':
        cnt[id] += 2 * acc2
        acc2 = 0
        next()
    if acc4 > 0 and l != 'drawfour':
        cnt[id] += 4 * acc4
        acc4 = 0
        next()

    cnt[id] -= 1
    if i == M - 1:
        print(id + 1, -cnt[id])
    if l == 'number':
        pass
    elif l == 'drawtwo':
        acc2 += 1
    elif l == 'drawfour':
        acc4 += 1
    elif l == 'skip':
        next()
    else:
        reverse = not reverse

    next()