#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n, q; cin >> n >> q;
    set<tuple<int, int, string>> st;
    vector<string> ans;
    map<string, int> rate;
    while(q--){
        int type; cin >> type;

        if(type == 1){
            string s;
            int r;
            cin >> s >> r;
            rate[s] = r;
            if(n>(int)st.size()){
                st.insert({0, r, s});
            }else{
                ans.pb(s);
            }
        }

        if(type == 2){
            int x; cin >> x;
            n -= x;
            vector<pair<int, string>> tmp;
            while((int)st.size()>n){
                auto itr = st.begin();
                tmp.pb({get<1>(*itr), get<2>(*itr)});
                st.erase(itr);
            }
            sort(all(tmp));
            for(auto [r, s] : tmp) ans.pb(s);
        }
        
        if(type == 3){
            string s; cin >> s;
            int x; cin >> x;
            if(st.find({0, rate[s], s}) != st.end()){
                auto itr = st.lower_bound({0, rate[s], s});
                st.erase(itr);
                st.insert({1, rate[s], s});
            }

            n += x;
        }
    }

    for(string s : ans) cout << s << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}