#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct settings{settings(){ios_base::sync_with_stdio(0); cin.tie(0); cout<<fixed<<setprecision(15);};}settingss;
const double PI = acos(-1);
const int INF = 1001001001;
const ll LINF = 1001001001001001001LL;

multiset<string> st;
queue<string> que;

int main() {
  int N, K, Q; cin >> N >> K >> Q;
  while(Q--) {
    int op; cin >> op;
    if(op == 1) {
      string S; cin >> S;
      st.insert(S);
      que.push(S);
      if((int)que.size() > N) {
        st.erase(st.find(que.front()));
        que.pop();
      }
    } else {
      int sum = 0;
      int ans = 0;
      queue<string> tmp;
      rep(i, 6) {
        string t; cin >> t;
        int d; cin >> d;
        if(st.find(t) != st.end()) {
          sum += min(d, K);
        } else {
          sum += d;
        }
        if(sum <= 60) {
          ans++;
          tmp.push(t);
        }
      }
      cout << ans << endl;
      rep(i, tmp.size()) {
        string S = tmp.front();
        tmp.pop();
        st.insert(S);
        que.push(S);
        if((int)que.size() > N) {
          st.erase(st.find(que.front()));
          que.pop();
        }
      }
    }
  }
}