from collections import deque
N, K, Q = map(int,input().split())

q = deque([])
while Q:
    Q -= 1
    n = int(input())
    #print(q)
    if n == 1:
        a = input()
        q.appendleft(a)
        if len(q) > N:
            q.pop()
    else:
        P = []
        now = 0
        ans = 0
        f = 0
        for i in range(6):
            t, d = input().split()
            d = int(d)
            if t in q:
                if now + min(d, K) <= 60:
                    if f == 0:
                        now += min(d, K)
                        ans += 1
                else:
                    f += 1
            else:
                if now + d <= 60:
                    if f == 0:
                        P.append(t)
                        now += d
                        ans += 1
                else:
                    f += 1
        print(ans)
        for i in range(len(P)):
            q.appendleft(P[i])
            if len(q) > N:
                q.pop()