#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}
template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

int main(){
	int n, k, q; cin >> n >> k >> q;
	vector<string> v;
	rep(num,0,q){
		int t; cin >> t;
		if (t == 1){
			string s; cin >> s;
			v.push_back(s);
		}else{
			vector<string> prob(6);
			vector<int> times(6);
			int cnt = 0;
			rep(i,0,6){
				cin >> prob[i] >> times[i];
			}
			int now = 0;
			rep(i,0,6){
				bool isgood = false;
				rep(j,0,n){
					if ((int)v.size()-1-j < 0) break;
					if (v[(int)v.size()-1-j] == prob[i]){
						isgood = true;
						break;
					}
				}
				int dr = times[i];
				if (isgood){
					chmin(dr, k);
				}
				if (now + dr <= 60){
					now += dr;
					cnt++;
				}else{
					break;
				}
			}
			rep(i,0,cnt){
				v.push_back(prob[i]);
			}
			cout << cnt << "\n";
		}

	}
}