#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  int n, k, q;
  cin >> n >> k >> q;
  map<string, int> mp;
  queue<string> que;
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      string s;
      cin >> s;
      mp[s]++;
      que.push(s);
      if (que.size() > n) {
        string s = que.front();
        que.pop();
        mp[s]--;
      }
    }
    else {
      int ans = 0, tim = 0;
      vector<pair<string, int>> v(6);
      rep(i, 6) cin >> v[i].first >> v[i].second;
      rep(i, 6) {
        int tmp;
        if (mp[v[i].first] > 0) {
          tmp = min(k, v[i].second);
        }
        else {
          tmp = v[i].second;
        }
        if (tim + tmp > 60) break;
        tim += tmp;
        ans++;
      }
      cout << ans << endl;
      rep(i, ans) {
        que.push(v[i].first);
        mp[v[i].first]++;
        if (que.size() > n) {
          string s = que.front();
          que.pop();
          mp[s]--;
        }
      }
    }
  }
  return 0;
}