# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
from collections import *

# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import *  # PyPyだと遅い
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os

# sys.setrecursionlimit(10**6) # PyPyだと遅い
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
isFile = os.path.exists("input.txt")
File = open("input.txt", "r", encoding="utf-8") if isFile else sys.stdin


def input():
    return File.readline()[:-1]


# ///////////////////////////////////////////////////////////////////////////


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

que = deque([], N)
for _ in range(Q):
    i = int(input())
    if i == 1:
        que.append(input())
    if i == 2:
        problem = [input().split() for _ in range(6)]
        total = 0
        cnt = 0
        for i, j in problem:
            j = int(j)
            total += j if i not in que else min(j, K)
            if total > 60:
                break
            cnt += 1
        print(cnt)
        for i, j in problem:
            que.append(i)