# 問題文が長すぎる

N, K, Q = map(int, input().split())

from collections import deque
que = deque()
seen = set()

for q in range(Q):
    t = int(input())
    if t == 1:
        s = input()
        if len(que) < N:
            que.append(s)
        elif len(que) == N:
            que.popleft()
            que.append(s)
    elif t == 2:
        counting = True
        ans = 0
        time = 0
        solved = []
        for i in range(6):
            t, d = map(str, input().split())
            d = int(d)
            if t in que:
                d = min(d, K)
            if time + d <= 60:
                if counting == True:
                    ans += 1
                    time += d
                    solved.append(t)
            else:
                counting = False
                
        for sol in solved:
            if len(que) < N:
                que.append(sol)
            elif len(que) == N:
                que.popleft()
                que.append(sol)
        print(ans)
    #print('que', que)