#include <bits/stdc++.h>
namespace std {
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &v) {
    is >> v.first >> v.second;
    return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
    for(T &in : v)
        is >> in;
    return is;
}
} // namespace std
#include <atcoder/all>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace atcoder;
using namespace boost::multiprecision;
using ll = long long;
using mint = modint998244353;
#define all(v) v.begin(), v.end()
#define rep(a, b) for(long long a = 0; a < (long long)(b); a++)
int op(int a, int b) { return min(a, b); }
int e() { return 2147483647; }

int main() {
    int N, K, Q;
    cin >> N >> K >> Q;
    vector<string> A;
    int siten = 0;
    rep(fjdfjsdkal, Q) {
        int que;
        cin >> que;
        if(que == 1) {
            string s;
            cin >> s;
            A.push_back(s);
            if(A.size() - siten == N + 1)
                siten++;
        }
        if(que == 2) {
            vector<pair<string, int>> T(6);
            cin >> T;
            int time = 0;
            int ret = 0;
            rep(i, 6) {
                bool sonzai = false;
                for(int j = siten; j < A.size(); j++) {
                    if(T[i].first == A[j])
                        sonzai = true;
                }
                if(sonzai) {
                    if(time + min(T[i].second, K) <= 60) {
                        time += min(T[i].second, K);
                        ret++;
                    } else
                        break;
                } else {
                    if(time + T[i].second <= 60) {
                        time += T[i].second;
                        ret++;
                    } else
                        break;
                }
            }
            cout << ret << endl;
            rep(i, ret) {
                A.push_back(T[i].first);
                if(A.size() - siten == N + 1)
                    siten++;
            }
        }
    }
}