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

solved: set[str] = set()

for _ in range(Q):
    tp = int(input())
    if tp == 1:
        solved.add(input())
    else:
        info = [input().split() for _ in range(6)]
        sd = [(s, int(d)) for s, d in info]

        rem = 60
        ret = 0
        for s, d in sd:
            req = d
            if s in solved:
                req = min(req, K)
            if req <= rem:
                ret += 1
                rem -= req
                solved.add(s)
            else:
                break
        print(ret)