#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int N, K, Q; cin >> N >> K >> Q;
  vector<string> A;

  auto search = [&](string t, int d) {
    int M = A.size();
    for (int i = max(0, M - N); i < M; i++)
      if (t == A.at(i)) return min(K, d);
    return d;
  };
  
  for (int i = 0; i < Q; i++) {
    int Query; cin >> Query;

    if (Query == 1) {
      string S; cin >> S;
      A.push_back(S);
     }
    if (Query == 2) {
      int T = 60, C = 0;
      vector<string> t(6);
      vector<int> d(6);
      for (int i = 0; i < 6; i++)
        cin >> t.at(i) >> d.at(i);

      while (C != 6) {
        int m = search(t.at(C), d.at(C));
        if (m > T) break;
        T -= m;
        C++;
      }

      cout << C << endl;
      for (int i = 0; i < C; i++) A.push_back(t.at(i));
    }
  }
}