import queue
N, K, Q = map(int, input().split())
q = []
for _ in range(Q):
    t = int(input())
    if t == 1:
        s = input()
        q.append(s)
        if len(q) > N: q.pop(0)
    else:
        s = set()
        for i in q:
            s.add(i)
        sum = 0;ans = 0
        for i in range(6):
            p = input().split()
            if p[0] in s:
                sum = sum + min(int(p[1]), K)
            else:
                sum = sum + int(p[1])
            if sum <= 60:
                ans = ans + 1
                q.append(p[0])
                if len(q) > N: q.pop(0)
        print(ans)