#include<bits/stdc++.h>
using namespace std;
#define ll long long
/*hi, I'm rintaro. I’m the writer of the problem.*/
int main() {
  //writerの確認コード
  ll N, K, Q, j=0;
  cin >> N >> K >> Q;
  priority_queue<pair<ll,string>> Kishi;
  for(ll i = 0; i < Q; i++) {
    ll x;
    cin >> x;
    if(x == 1) {
      string s;
      cin >> s;
      Kishi.push({j,s});
      j++;
    }
    else {
      vector<string> Last;
      ll siz = min(N,(ll)Kishi.size());
      for(ll l = 0; l < siz; l++) {
        Last.push_back(Kishi.top().second);
        Kishi.pop();
      }
      vector<ll> d(6);
      vector<string> t(6);
      for(ll k = 0; k < 6; k++) {
        cin >> t[k] >> d[k];
        if(find(Last.begin(),Last.end(),t[k]) != Last.end()) d[k] = min(d[k], K);
      }
      if(d[0] > 60) {
        cout << 0 << endl;
      }
      else if(d[0] + d[1] > 60) {
        cout << 1 << endl;
        Kishi.push({j,t[0]});j++;
      }
      else if(d[0] + d[1] + d[2] > 60) {
        cout << 2 << endl;
        Kishi.push({j,t[0]});j++;
        Kishi.push({j,t[1]});j++;
      }
      else if(d[0] + d[1] + d[2] + d[3] > 60) {
        cout << 3 << endl;
        Kishi.push({j,t[0]});j++;
        Kishi.push({j,t[1]});j++;
        Kishi.push({j,t[2]});j++;
      }
      else if(d[0] + d[1] + d[2] + d[3] + d[4] > 60) {
        cout << 4 << endl;
        Kishi.push({j,t[0]});j++;
        Kishi.push({j,t[1]});j++;
        Kishi.push({j,t[2]});j++;
        Kishi.push({j,t[3]});j++;
      }
      else if(d[0] + d[1] + d[2] + d[3]+ d[4] + d[5] > 60) {
        cout << 5 << endl;
        Kishi.push({j,t[0]});j++;
        Kishi.push({j,t[1]});j++;
        Kishi.push({j,t[2]});j++;
        Kishi.push({j,t[3]});j++;
        Kishi.push({j,t[4]});j++;
      }
      else {
        cout << 6 << endl;
        Kishi.push({j,t[0]});j++;
        Kishi.push({j,t[1]});j++;
        Kishi.push({j,t[2]});j++;
        Kishi.push({j,t[3]});j++;
        Kishi.push({j,t[4]});j++;
        Kishi.push({j,t[5]});j++;
      }
    }
  }
}