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

int main(void) {
    int n, k, q; cin >> n >> k >> q;
    map<string, int> last_turn_solved;
    int turn = 0;
    while(q--) {
        int op; cin >> op;
        if(op == 1) {
            string s; cin >> s;
            last_turn_solved[s] = turn++;
        } else {
            vector<string> t(6);
            vector<int> d(6);
            for(int i = 0; i < 6; i++) {
                cin >> t[i] >> d[i];
            }
            int sum_solvable_time = 0;
            int ans = 0;
            for(;ans < 6; ans++) {
                bool kishikan = last_turn_solved.count(t[ans]) && last_turn_solved[t[ans]] + n >= turn;
                sum_solvable_time += kishikan ? min(d[ans], k) : d[ans];
                if(sum_solvable_time > 60) break;
            }
            cout << ans << '\n';
            for(int i = 0; i < ans; i++) {
                last_turn_solved[t[i]] = turn++;
            }
        }
    }
}