#include <bits/stdc++.h>
//#include <atcoder/all>
using ll = long long;
#define MOD 1000000007
#define Mod 998244353
const int MAX = 1000000005;
const long long INF = 1000000000000000005LL;
using namespace std;
//using namespace atcoder;
#define MOD 1000000007



int main() {
    ios::sync_with_stdio(0); cin.tie();
    int N, Q;
    cin >> N >> Q;
    map<string, bool> available;
    map<int, string> member;
    while (Q--) {
        int t;
        cin >> t;
        if (t == 1) {
            string s;
            int r;
            cin >> s >> r;
            member[r] = s;
            available[s] = false;
        } else if (t == 2) {
            int x;
            cin >> x;
            N -= x;
        } else {
            string s;
            int x;
            cin >> s >> x;
            available[s] = true;
            N += x;
        }

        if (member.size() > N) {
            int rest = N;
            queue<int> que;
            priority_queue<int, vector<int>, greater<int>> pq;
            for (auto it = member.rbegin(); it != member.rend(); it++) {
                if (available[it->second]) que.push(it->first);
            }
            for (auto it = member.rbegin(); it != member.rend(); it++) {
                if (!available[it->second]) que.push(it->first);
            }
            while (que.size()) {
                int r = que.front();
                que.pop();
                if (rest > 0) rest--;
                else pq.push(r);
            }
            while (pq.size()) {
                int r = pq.top();
                pq.pop();
                cout << member[r] << endl;
                available.erase(member[r]);
                member.erase(r);
            }
        }
    }
}