#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    int N, K, Q, ans, d, t, sm;
    string S;
    cin >> N >> K >> Q;

    map<string, int> mp;
    queue<string> que;

    while(Q){
        Q--;
        cin >> t;
        if (t == 1){
            cin >> S;
            que.push(S);
            mp[S]++;
            if (que.size() == N+1){
                S = que.front();
                que.pop();
                mp[S]--;
            }
        }
        else{
            sm = 0;
            ans = 0;
            vector<string> v;
            bool f=0;
            for (int i=0; i<6; i++){
                cin >> S >> d;
                if (mp[S] > 0) d = min(d, K);
                if (!f && sm + d <= 60){
                    sm += d;
                    ans++;
                    v.push_back(S);
                }
                else f=1;
            }
            for (auto x : v){
                que.push(x);
                mp[x]++;
                if (que.size() == N+1){
                    S = que.front();
                    que.pop();
                    mp[S]--;
                }
            }
            cout << ans << endl;
        }
    }

    return 0;
}