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

L = list(input() for i in range(M))
D = {}
D_debt = {}
for i in range(N) :
    D[i+1] = 0
    D_debt[i+1] = 0

turn = 1
reverse = 0
debt = 0
state = ""
def next() :
    global turn
    if reverse == 1 : turn -= 1
    else : turn += 1
    if turn == 0 : turn = N
    elif turn == N+1 : turn = 1
    return turn

def judge(L) :
    if len(L) == 0 : print(turn, D[turn]-D_debt[turn])

while len(L) != 0 :
    if state == "skip" :
        state = ""
    elif state == "drawtwo" :
        if L[0] == state :
            D[turn] += 1
            debt += 2
            L.pop(0)
        else :
            D_debt[turn] += debt
            debt = 0
            state = ""
    elif state == "drawfour" :
        if L[0] == state :
            D[turn] += 1
            debt += 4
            L.pop(0)
        else :
            D_debt[turn] += debt
            debt = 0
            state = ""
    else :
        state = L.pop(0)
        D[turn] += 1
    if state == "reverse" :
        reverse = (reverse + 1) % 2
        state = ""
    elif state == "drawtwo" :
        debt = 2
    elif state == "drawfour" :
        debt = 4
    judge(L)
    turn = next()