#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n;
    cin >> n;
    int q;
    cin >> q;
    unordered_map<string, int> rate;
    vector<string> ans;
    set<pair<int, string>> vs;
    while(q--) {
        int t;
        cin >> t;
        if(t==1){
            string s;
            int r;
            cin >> s >> r;
            rate[s] = r;
            vs.emplace(r, s);
        }   
        else if(t==2){
            int x;
            cin >> x;
            n-=x;
        }
        else{
            string s;
            int x;
            cin >> s >> x;
            n+=x;
            vs.erase(make_pair(rate[s], s));
            if(rate[s]<5000) {
                rate[s] += 5000;
            }
            vs.emplace(rate[s],s);
        }
        dbg(vs,n);
        if(vs.size()>n) {
            int y = vs.size()-n;
            auto it = vs.begin();
            vector<pair<int, string>> tmp;
            vector<pair<int, string>> erase;
            rep(i,y) {
                if((*it).first>=5000) tmp.emplace_back((*it).first-5000,(*it).second);
                else tmp.emplace_back(*it);
                erase.emplace_back((*it).first,(*it).second);
                it++;
            }
            for(auto t : erase) vs.erase(t);
            sort(tmp.begin(),tmp.end());
            for(auto t : tmp) cout<<t.second << endl;
        }
    }
    return 0;
}