#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    ll N, K, Q; cin >> N >> K >> Q;
    stack<string>A;
    while (Q--) {
        int t; cin >> t;
        if (t == 1) {
            string T; cin >> T;
            A.push(T);
        }
        else {
            set<string>S;
            stack<string>B = A;
            while (!B.empty() && S.size() < N) {
                S.insert(B.top()); B.pop();
            }
            string T; ll time;
            ll ans = 0, sum = 0;
            for (int i = 0; i < 6; i++) {
                cin >> T >> time;
                if (S.find(T) == S.end()) {
                    sum += time;
                }
                else sum += min(time, K);
                if (sum <= 60) {
                    A.push(T);
                    ans++;
                }
            }
            cout << ans << endl;
        }
    }
}