#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using P = pair<int, string>;
int main() {
   int n, q; cin >> n >> q;
   set<P> fx, ufx;
   map<string, int> s2r;
   while(q--) {
      int t; cin >> t;
      if(t == 1) {
         string s; int r; cin >> s >> r;
         s2r[s] = r;
         ufx.insert(P(r, s));
         if(fx.size() + ufx.size() > n) {
            cout << ufx.begin()->second << endl;
            ufx.erase(ufx.begin());
         }
      } else if(t == 2) {
         int x; cin >> x;
         n -= x;
         if(fx.size() + ufx.size() > n) {
            int g = fx.size() + ufx.size() - n;
            set<P> ans;
            rep(i, g) {
               if(!ufx.empty()) {
                  ans.insert(*ufx.begin());
                  ufx.erase(ufx.begin());
               } else {
                  ans.insert(*fx.begin());
                  fx.erase(fx.begin());
               }
            }
            for(auto i: ans) cout << i.second << endl;
         }
      } else {
         string s; int x; cin >> s >> x;
         n += x;
         int r = s2r[s];
         ufx.erase(P(r, s));
         fx.insert(P(r, s));
      }
   }
}