#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k,q;
    cin >> n >> k >> q;
    queue<string> que;
    map<string,int> mp;
    while(q--){
        int t;
        cin >> t;
        if(t==1){
            string s;
            cin >> s;
            que.push(s);
            mp[s]++;
        }else{
            int tot = 0, ans = 0;
            rep(i,6){
                string s;
                int d;
                cin >> s >> d;
                if(mp[s]) chmin(d,k);
                tot += d;
                if(tot<=60){
                    mp[s]++;
                    que.push(s);
                    ans++;
                }
            }
            cout << ans << '\n';
        }
        while(que.size()>n){
            mp[que.front()]--;
            que.pop();
        }
    }
    return 0;
}