import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,K,Q = input().split()
    N = int(N)
    K = int(K)
    Q = int(Q)
    a = 0
    A = [""]*N
    for _ in range(Q):
        que = II()
        if(que==1):
            S = input()
            A[a] = S
            a+=1
            a%=N
        elif(que==2):
            T = [""]*6
            D = [0]*6
            for i in range(6):
                T[i],D[i] = input().split()
                D[i] = int(D[i])
            Time = 0
            Ans = 0
            for i in range(6):
                if(T[i] in A):
                    Time += min(D[i],K)
                else:
                    Time += D[i]
                if(60<Time):
                    Ans = i
                    print(Ans)
                    break
                if(i==5):
                    Ans = 6
                    print(Ans)
                    break
            for i in range(Ans):
                A[a]=T[i]
                a+=1
                a%=N
    return
solve()