import queue
N, K, Q = map(int, input().split())
s = set()
q = queue.Queue()
for _ in range(Q):
    t = input().split()
    if t[0] == '1':
        if t[1] in s: continue
        q.put(t[1])
        s.add(t[1])
        if len(s) > N:
            v = q.get()
            s.discard(v)
    else:
        a = [int(t[2 * i + 2]) for i in range(6)]
        b = [t[2 * i + 1] for i in range(6)]
        q2 = queue.Queue()
        sum = 0;ans = 0
        for i in range(6):
            if b[i] in s: sum = sum + min(a[i], K)
            else: sum = sum + a[i]
            if sum <= 60: 
                ans = ans + 1
                q2.put(b[i])
        print(ans)
        while not q2.empty():
            v = q2.get()
            if not v in s:
                q.put(v)
                s.add(v)
                if len(s) > N:
                    w = q.get()
                    s.discard(w)