// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using Real = mp::number<mp::cpp_dec_float<1024>>;
using Rat = boost::rational<Bint>;

typedef long long ll;
const ll INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define rrep(i, n) for (ll i = ll(n) - 1; i >= 0; --i)

#define all(v) v.begin(), v.end()
#define llpow(x, y) (ll) pow(x, y)
#define llacumulate(v) accumulate(all(v), 0LL)
#define endl "\n"
#define popcount __builtin_popcount

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;

void YN(bool b) { cout << (b ? "Yes" : "No") << endl; }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }

struct Fast
{
    Fast()
    {
        std::cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} fast;

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

template <typename T>
inline void print(const T &x)
{
    cout << x << "\n";
}
template <typename T>
inline void print(const vector<T> &v, string s = " ")
{
    rep(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
template <typename T>
inline void print(const vector<vector<T>> &v)
{
    for (auto &&p : v)
        print(p);
}
template <typename T, typename S>
inline void print(const pair<T, S> &p)
{
    cout << p.first << " " << p.second << endl;
}
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v)
{
    for (auto &&p : v)
        print(p);
}

#ifdef LOCAL
#include <library/debug_print.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif

int main()
{
    ll n, k, q; // n:既視感 k:短縮(もとより小さい場合)
    cin >> n >> k >> q;

    deque<string> solved;

    rep(i, q)
    {
        ll a;
        cin >> a;

        if (a == 1)
        {
            string s;
            cin >> s;
            solved.push_back(s);
            if (solved.size() > n)
                solved.pop_front();
        }
        else
        {
            ll tm = 0, cnt = 0;
            vs t(6);
            vl d(6);
            rep(j, 6) cin >> t[j] >> d[j];
            rep(j, 6)
            {
                bool flag = false;
                for (auto x : solved)
                {
                    if (x == t[j])
                        flag = true;
                }
                if (flag)
                {
                    tm += min(d[j], k);
                }
                else
                    tm += d[j];
                if (tm <= 60)
                {
                    cnt++;
                }
                else
                    break;
            }
            rep(j,cnt){
                solved.push_back(t[j]);
            }
            if (solved.size() > n)
            {
                rep(e, solved.size() - n)
                    solved.pop_front();
            }
            print(cnt);
        }
    }
}