#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, Q; cin >> N >> Q;

    map<int, string> r2s;
    map<string, int> s2r;

    set<int> st1, st2;

    vector<string> ans;
    auto f = [&](){
        vector<int> add;
        while(N < (int)st1.size() + (int)st2.size()){
            if(!st2.empty()){
                auto itr = st2.begin();
                add.push_back(*itr);
                st2.erase(itr);
            }
            else{
                auto itr = st1.begin();
                add.push_back(*itr);
                st1.erase(itr);
            }
        }
        sort(all(add));
        for(auto &r : add) ans.push_back(r2s[r]);
    };

    rep(q, Q){
        int op; cin >> op;
        if(op == 1){
            string s; cin >> s;
            int r; cin >> r;
            r2s[r] = s;
            s2r[s] = r;
            st2.insert(r);
            f();
        }
        if(op == 2){
            int x; cin >> x;
            N -= x;
            f();
        }
        if(op == 3){
            string s; cin >> s;
            int x; cin >> x;
            N += x;
            if(st2.find(s2r[s]) != st2.end()){
                st2.erase(s2r[s]);
                st1.insert(s2r[s]);
            }
        }
    }

    for(auto &v : ans) cout << v << endl;
}