#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	struct data {
		string name;
		int rate = 0;
		bool fix = false;
		bool ex = false;
		data(string name = "", int rate = 0, bool fix = false, bool ex = false) :
			name(name), rate(rate), fix(fix), ex(ex) {}
	};
	map<string, int>mp;
	vector<data>d(100);
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			string s;
			int r; cin >> s >> r;
			mp[s] = mp.size();
			d[mp[s]] = data(s, r, false, true);
		}
		else if (2 == t) {
			int x; cin >> x;
			n -= x;
		}
		else {
			string s;
			int x;
			cin >> s >> x;
			n += x;
			d[mp[s]].fix = true;
		}
		vector<data>v0, v1;
		rep(i, d.size()) {
			if (!d[i].ex)continue;
			if (d[i].fix)v0.push_back(d[i]);
			else v1.push_back(d[i]);
		}
		std::sort(v0.begin(), v0.end(), [](data l, data r) {
			return l.rate > r.rate; }
		);
		std::sort(v1.begin(), v1.end(), [](data l, data r) {
			return l.rate > r.rate; }
		);
		vector<data>v2;
		int cn = n;
		rep(_, 2) {
			rep(i, v0.size()) {
				if (cn) {
					cn--;
					continue;
				}
				string s = v0[i].name;
				v2.push_back(v0[i]);
				d[mp[s]].ex = false;
			}
			swap(v0, v1);
		}
		std::sort(v2.begin(), v2.end(), [](data l, data r) {
			return l.rate < r.rate; }
		);
		rep(i, v2.size())cout << v2[i].name << endl;
	}
	return 0;
}