#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,k,q,cnt=0;cin>>n>>k>>q;
  queue<string> que;
  unordered_map<string,int> mp;
  while(q--){
    int c;cin>>c;
    if(c==1){
      string s;cin>>s;
      mp[s]++;
      cnt++;
      que.push(s);
      if(cnt==n+1){
        auto ss=que.front();que.pop();
        mp[ss]--;
        cnt--;
      }
    }else{
      vs T(6);vl D(6);rep(i,0,6)cin>>T[i]>>D[i];
      ll ans=0,sc=0;
      rep(i,0,6){
        if(mp[T[i]]>0)sc+=min(D[i],k);
        else sc+=D[i];
        if(sc>60){
          cout<<ans<<el;
          break;
        }
        que.push(T[i]);
        mp[T[i]]++;
        ans++;
        cnt++;
      }
      if(ans==6)cout<<6<<el;
      while(cnt>n){
        auto ss=que.front();que.pop();
        mp[ss]--;
        cnt--;
      }
    }
  }
}