#include #ifdef LOCAL #include #else #define debug(...) void(0) #endif template std::istream& operator>>(std::istream& is, std::vector& v) { for (auto& e : v) { is >> e; } return is; } template std::ostream& operator<<(std::ostream& os, const std::vector& v) { for (std::string_view sep = ""; const auto& e : v) { os << std::exchange(sep, " ") << e; } return os; } template bool chmin(T& x, U&& y) { return y < x and (x = std::forward(y), true); } template bool chmax(T& x, U&& y) { return x < y and (x = std::forward(y), true); } template void mkuni(std::vector& v) { std::ranges::sort(v); auto result = std::ranges::unique(v); v.erase(result.begin(), result.end()); } template int lwb(const std::vector& v, const T& x) { return std::distance(v.begin(), std::ranges::lower_bound(v, x)); } using ll = long long; using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); int N, Q; cin >> N >> Q; int cur = N; set> pq1, pq2; map rate; auto update = [&]() { vector> cand; while (not pq2.empty() and int(pq1.size()) + int(pq2.size()) > cur) { auto [r, s] = *pq2.begin(); pq2.erase({r, s}); cand.emplace_back(r, s); } while (not pq1.empty() and int(pq1.size()) > cur) { auto [r, s] = *pq1.begin(); pq1.erase({r, s}); cand.emplace_back(r, s); } ranges::sort(cand); for (auto [r, s] : cand) cout << s << "\n"; }; for (; Q--;) { int t; cin >> t; if (t == 1) { string s; int r; cin >> s >> r; pq2.emplace(r, s); rate[s] = r; } else if (t == 2) { int x; cin >> x; cur -= x; } else { string s; int x; cin >> s >> x; cur += x; int r = rate[s]; pq2.erase({r, s}); pq1.emplace(r, s); } update(); } return 0; }