#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;
    map<int, string> fixer, member;
    map<string, int> revmember;
    for(int i = 0; i < Q; i++) {
        int que;
        cin >> que;
        if(que == 1) {
            string s;
            int r;
            cin >> s >> r;
            member[r] = s;
            revmember[s] = r;
            if((int)fixer.size() + (int)member.size() > N) {
                cout << (*member.begin()).second << endl;
                revmember.erase((*member.begin()).second);
                member.erase(member.begin());
            }
        } else if(que == 2) {
            int x;
            cin >> x;
            N -= x;
            if((int)fixer.size() >= N) {
                map<int, string> ret = member;
                member = {};
                revmember = {};
                while((int)fixer.size() > N) {
                    ret.emplace(*fixer.begin());
                    fixer.erase(fixer.begin());
                }
                for(auto a : ret)
                    cout << a.second << endl;
            } else if((int)member.size() > N - (int)fixer.size()) {
                map<int, string> ret;
                while((int)member.size() > N - (int)fixer.size()) {
                    ret.emplace(*member.begin());
                    revmember.erase((*member.begin()).second);
                    member.erase(member.begin());
                }
                for(auto a : ret)
                    cout << a.second << endl;
            }
        } else {
            string s;
            int x;
            cin >> s >> x;
            N += x;
            if(revmember.contains(s)) {
                fixer[revmember[s]] = s;
                member.erase(revmember[s]);
                revmember.erase(s);
            }
        }
    }
}