#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) {}
	};
	vector<data>d;
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			string s;
			int r; cin >> s >> r;
			d.push_back(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;
			rep(i, d.size()) {
				if (s == d[i].name) {
					d[i].fix = true;
					break;
				}
			}
		}
		if (d.size() >= n)continue;
		std::sort(d.begin(), d.end(), [](data l, data r) {
			if (l.fix == r.fix)return l.rate > r.rate;
			return l.fix > r.fix;
			}
		);
		vector<data>out;
		int num = max(0, (int)d.size() - n);
		rep(i, num) {
			out.push_back(d.back());
			d.pop_back();
		}
		std::sort(out.begin(), out.end(), [](data l, data r) {
			return l.rate < r.rate; }
		);
		rep(i, out.size())cout << out[i].name << endl;
	}
	return 0;
}