#include #include #include #include #include #include using namespace std; #define reps(i, a, n) for (int i = (a); i < (int)(n); ++i) #define rep(i, n) reps(i, 0, n) #define repe(i,n) for(auto i : n) #define ALL(x) x.begin(),x.end() #define SIZE(x) ll(x.size()) #define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf #define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf #define MOD 1000000007 //問題による #define F first #define S second #define cYes cout << "Yes" << endl; #define cNo cout << "No" << endl; #define ll long long #define vmax(x) *max_element(x.begin(), x.end()) #define vmin(x) *min_element(x.begin(), x.end()) #define coutALL(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<" ";cout<<*--x.end()< #define vvi vector > #define vll vector #define vvll vector > int main(){ int n,k,q; cin >> n >> k >> q; vector que; rep(i,q){ int x; cin >> x; if(x == 1){ string s; cin >> s; que.push_back(s); } else{ int d; string t; vi timer(8); int ff = 0; rep(j,6){ cin >> t >> d; int f = 0; int ite = que.size() - n; if( ite < 0) ite = 0; for(int r = que.size()-1; r >= ite; r--) { if(que[r] == t){ f = 1; break; } } if(f){ timer[j+1] = timer[j] + k; } else{ timer[j+1] = timer[j] + d; } } timer[7] = 1e9; coutALL(timer); reps(j,1,8){ if(timer[j] > 60){ cout << j-1 << endl; ff = 1; break; } } if(!ff){ cout << 6 << endl; } } } }