import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

from collections import deque, Counter

n, k, q = LI()

fq = deque()
fc = Counter()

def push(s):
    fq.append(s)
    fc[s] += 1

def pop():
    s = fq.popleft()
    fc[s] -= 1

for _ in range(q):
    while len(fq) > n: pop()
    if II() == 1:
        s = SI()
        push(s)
    else:
        t = 0
        ans = 6
        sd = [SI().split() for _ in range(6)]
        for i, (s, d) in enumerate(sd):
            d = int(d)
            if fc[s]:
                t += min(d, k)
            else:
                t += d
            if t > 60:
                ans = i
                break
        for s, d in sd[:ans]: push(s)
        print(ans)