#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,K,Q; cin >> N >> K >> Q;
  deque<string> q;
  while(Q--){
    int op; cin >> op;
    if(op==1){
      string s; cin >> s;
      q.push_back(s);
      while(sz(q) > N){
        q.pop_front();
      }
    }
    else{
      vector<pair<string,int>> P(6);
      rep(i,6) cin >> P[i].first >> P[i].second;
      int ans = 0;
      int T = 0;
      rep(i,6){
        int t = P[i].second;
        rep(j,sz(q)){
          if(P[i].first==q[j]){
            chmin(t,K);
            break;
          }
        }
        if(T+t<=60){
          ans++;
          T+=t;
        }
        else break;
      }
      cout << ans << '\n';
      rep(i,6){
        q.push_back(P[i].first);
      }
      while(sz(q)>N){
        q.pop_front();
      }
    }
  }
  return 0;
};