#include #include using namespace std; int main(void){ int n, k, q; cin >> n >> k >> q; int qnum; string s, t; int d; vector A, asa; for (int i = 0; i < q; i++) { cin >> qnum; if (qnum == 1) { cin >> s; A.push_back(s); } else if (qnum == 2) { int solt = 0; for (int a = 0; a < 6; a++) { bool nf = false; int m = (int)A.size(); cin >> t >> d; if (m > 0) { for (int j = 0; j < n; j++) { if (A[m-j-1] == t) { solt += min(d, k); break; } else if (j == n-1) nf = true; } } if (m <= 0 || nf) solt += d; if (solt <= 60) { asa.push_back(t); } } cout << asa.size() << endl; copy(asa.begin(), asa.end(), back_inserter(A)); asa.clear(); } } }