#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    ll N, K, Q; cin >> N >> K >> Q;
    vector<string>A;
    while (Q--) {
        ll t; cin >> t;
        if (t == 1) {
            string s; cin >> s;
            A.push_back(s);
        }
        else {
            set<string>S;
            for (ll i = A.size() - 1; i >= max(0ll, (ll)A.size() - N); i--) {
                S.insert(A[i]);
            }
            ll ans = 0, sum = 0;
            for (ll i = 0; i < 6; i++) {
                string s;
                ll tim;
                cin >> s >> tim;
                if (S.find(s) != S.end()) sum += min(tim, K);
                else sum += tim;
                if (sum <= 60) {
                    ans++;
                    A.push_back(s);
                }
            }
            cout << ans << endl;
        }
    }
}