#include<iostream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<chrono>
#include<cmath>
#include<complex>
#include<deque>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<tuple>
using namespace std;
#define ll long long
/*
hi, I'm rintaro.
AC is right
AC count is my life
But don't solve too many easy plobems!
*/
#define g(n,m) get<n>(m)
#define fof(i,o,n) for (ll i = o; i < (ll)n; i++)
#define fof_(i,a) for(auto &i : a)
#define vcin(a) fof_(i,a) cin>>i
#define all(o) o.begin(),o.end()
#define double long double
#define pii pair<ll,ll>
#define vec vector
#define vi vec<ll>
#define vs vec<string>
#define vc vec<char>
#define vvi vec<vi>
#define vpii vec<pii>
#define igpqueue priority_queue<ll,vi,greater<ll>>
#define re return
#define r0 re 0
#define ln(n) cout << n << endl
#define fix(n) << fixed << setprecision(n)
#define out_(n) << n << " "
#define Out cout
#define out(n) << n
#define End << endl
#define imap map<ll,ll>
#define smap map<string,ll>
#define gmap map<ll,vector<ll>>
#define m9 998244353
#define m7 1000000007
#define lny ln("Yes")
#define lnn ln("No")
int main() {
  //writerの確認コード
  ll N, K, Q, j=0;
  cin >> N >> K >> Q;
  priority_queue<pair<ll,string>> Kishi;
  fof(i,0,Q) {
    ll x;
    cin>>x;
    if(x==1) {
      string s;cin>>s;Kishi.push({j,s});j++;
    }
    else {
      vs Last;
      vi ord;
      ll HH=min(N,(ll)Kishi.size());
      fof(k,0,HH) {
        Last.push_back(Kishi.top().second);
        ord.push_back(Kishi.top().first);
        Kishi.pop();
      }
      ll a,b,c,d,e,f;
      string s,t,u,v,w,x;
      cin>>s>>a>>t>>b>>u>>c>>v>>d>>w>>e>>x>>f;
      if(find(all(Last),s)!=Last.end()) a=min(a,K);
      if(find(all(Last),t)!=Last.end()) b=min(b,K);
      if(find(all(Last),u)!=Last.end()) c=min(c,K);
      if(find(all(Last),v)!=Last.end()) d=min(d,K);
      if(find(all(Last),w)!=Last.end()) e=min(e,K);
      if(find(all(Last),x)!=Last.end()) f=min(f,K);
      if(a>60) ln(0);
      else if(a+b>60) {ln(1);Kishi.push({j,s});j++;}
      else if(a+b+c>60) {ln(2);Kishi.push({j,s});j++;Kishi.push({j,t});j++;}
      else if(a+b+c+d>60) {ln(3);Kishi.push({j,s});j++;Kishi.push({j,t});j++;Kishi.push({j,u});j++;}
      else if(a+b+c+d+e>60) {ln(4);Kishi.push({j,s});j++;Kishi.push({j,t});j++;Kishi.push({j,u});j++;Kishi.push({j,v});j++;}
      else if(a+b+c+d+e+f>60) {ln(5);Kishi.push({j,s});j++;Kishi.push({j,t});j++;Kishi.push({j,u});j++;Kishi.push({j,v});j++;Kishi.push({j,w});j++;}
      else {ln(6);Kishi.push({j,s});j++;Kishi.push({j,t});j++;Kishi.push({j,u});j++;Kishi.push({j,v});j++;Kishi.push({j,w});j++;Kishi.push({j,x});j++;}
    }
  }
}