#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
using ll = long long;


int main(){
    int n,k,q;
    cin>>n>>k>>q;
    deque<string> que;
    while(q--){
        int op;
        cin>>op;
        if(op==1){
            string a;
            cin>>a;
            que.push_back(a);
            while(que.size()>n) que.pop_front();
        }else{
            vector<string> a(6);
            vector<int> t(6);
            for(int i = 0;i<6;i++) cin>>a[i]>>t[i];
            int now = 0;
            int ni = 0;
            deque<string> use;
            for(int i = 0;i<6;i++){
                int need = t[i];
                bool ok = false;
                for(int j = 0;j<que.size();j++) ok |= (que[j] == a[i]);
                if(ok) need = min(need,k);
                if(now+need<=60){
                    now += need;
                    ni++;
                    use.push_back(a[i]);
                }else break;
            }
            cout<<ni<<endl;
            for(int i = 0;i<use.size();i++) que.push_back(use[i]);
            while(que.size()>n) que.pop_front();
        }
    }

}