#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, q;
    cin >> n >> q;

    const int FIX = 1e5;
    int pop = 0;
    map<string, int> rate;
    using P = pair<int, string>;
    priority_queue<P, vector<P>, greater<P>> pq;
    auto erase = [&]() {
        pop--;
        while(pq.top().first != rate[pq.top().second]) pq.pop();
        cout << pq.top().second << '\n';
        pq.pop();
    };
    while(q--) {
        int t;
        cin >> t;
        if(t == 1) {
            string s; int r;
            cin >> s >> r;
            rate[s] = r, pop++;
            pq.emplace(r, s);
        }
        if(t == 2) {
            int x;
            cin >> x;
            n -= x;
        }
        if(t == 3) {
            string s; int x;
            cin >> s >> x;
            n += x, rate[s] += FIX;
            pq.emplace(rate[s], s);
        }
        while(pop > n) erase();
    }
    return 0;
}