#include #include #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP1(i,n) for (auto i = std::decay_t{}; (i) != (n); ++(i)) #define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i)) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using P = pair; using LP = pair; using SP = pair; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using mint1 = modint1000000007; using mint9 = modint998244353; const int INF = 2e9; const long long LINF = 4e18; const int di[] = {0,1,0,-1,-1,1,-1,1}; const int dj[] = {1,0,-1,0,1,1,-1,-1}; template inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} template inline bool chmax(T& a, T b){if(a> n >> k >> q; vector st; rep(qi , q) { int type; cin >> type; if(type == 1) { string s; cin >> s; st.push_back(s); } else { string s; int d , time = 0 , cnt = 0; rep(i , 6) { cin >> s >> d; bool ok = false; rep(j , n) if(st[st.size()-1-j] == s) ok = true; if(ok) time += min(k , d); else time += d; if(time <= 60) { cnt++ , st.push_back(s); } } cout << cnt << endl; } } return 0; }