#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<string> f(vector<string>v, int k) {
	reverse(all(v));
	while (v.size() > k) v.pop_back();
	reverse(all(v));
	return v;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k, q; cin >> n >> k >> q;
	vector<string>v;
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			string s; cin >> s;
			v.push_back(s);
			v = f(v, n);
		}
		else {
			vector<string>s;
			int time = 0;
			int cnt = 0;
			bool chk = true;
			rep(i, 6) {
				bool chk2 = false;
				string t; cin >> t;
				int d; cin >> d;
				if (!chk)continue;
				rep(j, v.size()) if (t == v[j])chk2 = true;
				int x = d;
				if (chk2)chmin(x, k);
				//cout << time << endl;
				if (time +x <= 60) {
					s.push_back(t);
					time += x;
					cnt++;
				}
				else {
					chk = false;
				}
			}
			cout << cnt << endl;
			rep(i, s.size())v.push_back(s[i]);
			v = f(v, n);
		}
	}
	return 0;
}