n,k,q=map(int,input().split())

stack=[]
for _ in range(q):
  q1=int(input())
  if q1==1:
    s=input()
    stack.append(s)
  else:
    Q=[list(input().split()) for _ in range(6)]
    B=set()
    for j in range(min(n,len(stack))):
      B.add(stack[-1-j])
    for i in range(6):
      Q[i][1]=int(Q[i][1])
      if Q[i][0] in B:
        Q[i][1]=min(Q[i][1],k)

    t,cnt=60,0
    for p,d in Q:
      if d<=t:
        cnt+=1
        t-=d
        stack.append(p)
    print(cnt)