#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, K, Q;
  cin >> N >> K >> Q;
  vector<string> S;
  for (int i = 0; i < Q; i++){
    int T;
    cin >> T;
    if (T == 1){
      string s;
      cin >> s;
      S.push_back(s);
      if (S.size() > N){
        S.erase(S.begin());
      }
    }
    if (T == 2){
      vector<string> t(6);
      vector<int> d(6);
      for (int j = 0; j < 6; j++){
        cin >> t[j] >> d[j];
      }
      int ans = 0;
      int curr = 0;
      for (int j = 0; j < 6; j++){
        int cnt = S.size();
        for (int k = 0; k < cnt; k++){
          if (t[j] == S[k]){
            d[j] = min(d[j], K);
          }
        }
        if (curr + d[j] <= 60){
          ans++;
          curr += d[j];
        } else {
          break;
        }
      }
      for (int j = 0; j < ans; j++){
        S.push_back(t[j]);
        if (S.size() > N){
          S.erase(S.begin());
        }
      }
      cout << ans << endl;
    }
  }
}