from collections import deque, defaultdict

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

A = defaultdict(int)
que = deque()
for _ in range(Q):
    type = int(input())
    if type == 1:
        S = input()
        que.append(S)
        A[S] += 1
        if N < len(que):
            S = que.popleft()
            A[S] -= 1
    else:
        TD = [list(input().split()) for _ in range(6)]
        time = 0
        solve = []
        for i, (T, D) in enumerate(TD):
            D = int(D)
            if 1 <= A[T]:
                time += min(D, K)
            else:
                time += D
            if time <= 60:
                solve.append(T)
            else:
                print(i)
                break
        else:
            print(6)
        for s in solve:
            que.append(s)
            A[s] += 1
        while N < len(que):
            S = que.popleft()
            A[S] -= 1