#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0 ; (i)<(int)(n) ; (i)++)

int main(void){
    int n, q, count = 0;
    cin >> n >> q;
    set<pair<int, string>> bi;
    REP(i, q){
        int q1;
        cin >> q1;
        if(q1 == 1){
            string q2;
            int q3;
            cin >> q2 >> q3;
            bi.insert({q3, q2});
            count++;
            if(n < count){
                for(auto i : bi){
                    cout << i.second << endl;
                    break;
                }
                bi.erase(bi.begin());
                count--;
            }
        }else if(q1 == 2){
            int q2;
            cin >> q2;
            n -= q2;
            while(n < count){
                for(auto i : bi){
                    cout << i.second << endl;
                    break;
                }
                bi.erase(bi.begin());
                count--;
            }
        }else if(q1 == 3){
            string q2;
            int q3;
            cin >> q2 >> q3;
            n += q3;
            auto itr = find_if(bi.begin(), bi.end(), [q2](pair<int, string> p) {return p.second == q2;});
            bi.erase(itr);
            pair<int, string> tmp = *itr;
            if(tmp.first < 4001) tmp.first += 10000;
            bi.insert(tmp);
        }
    }
    //for(auto i : bi) cout << i.first << ' ' << i.second << endl;
}