#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 1000000010;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 1;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 998244353;

int main() {
    int n,k,q;
    cin >> n >> k >> q;
    vector<string> vec;
    for(int tmp = 0;tmp < q;tmp++) {
        int t;
        cin >> t;
        if(t == 1) {
            string s;
            cin >> s;
            vec.push_back(s);
        }
        if(t == 2) {
            vector<pair<string,int>> problem(6);
            for(auto& [t,d]: problem) cin >> t >> d;
            int time = 0;
            int count = 0;
            for(int i = 0;i < 6;i++) {
                bool isok = false;
                for(int j = 0;j < n;j++) {
                    if(vec.size() <= j) continue;
                    if(problem[i].first == vec[vec.size() - 1 - j]) {
                        isok = true;
                    }
                }
                if(isok) time += min(problem[i].second,k);
                else time += problem[i].second;
                if(time > 60) break;
                count++;
            }
            cout << count << endl;
        }
    }
}