#include <bits/stdc++.h>
using namespace std;
int main () {
	int N, K, Q;
	cin >> N >> K >> Q;
	unordered_map<string, int> mp;
	queue<string> S;
	while (Q--) {
		int t;
		cin >> t;
		if (t == 1) {
			string s;
			cin >> s;
			mp[s] ++;
			S.push(s);
			while (S.size() > N) {
				auto a = S.front();
				S.pop();
				mp[a] --;
			}
		} else {
			string A[6];
			int D[6];
			for (int i = 0; i < 6; i ++) {
				cin >> A[i] >> D[i];
			}
			int s = 0;
			int fl = 0;
			while (fl < 6) {
				int d = D[fl];
				if (mp.find(A[fl]) != mp.end() && mp[A[fl]]) {
					d = min(d, K);
				}
				s += d;
				if (s > 60) {
					break;
				}
				fl ++;
			}
			cout << fl << endl;
			for (int i = 0; i < fl; i ++) {
				mp[A[i]] ++;
				S.push(A[i]);
				while (S.size() > N) {
					auto a = S.front();
					S.pop();
					mp[a] --;
				}
			}
		}
	}
}