#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cassert>
using namespace std;
int now;
int Q;
map<string,int>R;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>now>>Q;
	set<pair<int,string> >cur;
	for(;Q--;)
	{
		int op;cin>>op;
		if(op==1)
		{
			string s;int r;cin>>s>>r;
			R[s]=r;
			cur.insert(make_pair(R[s],s));
		}
		else if(op==2)
		{
			int x;cin>>x;
			now-=x;
		}
		else
		{
			string s;int x;cin>>s>>x;
			now+=x;
			assert(cur.find(make_pair(R[s],s))!=cur.end());
			if(R[s]<=4000)
			{
				cur.erase(make_pair(R[s],s));
				R[s]+=10000;
				cur.insert(make_pair(R[s],s));
			}
		}
		vector<pair<int,string> >out;
		while(now<cur.size())
		{
			auto p=*cur.begin();
			cur.erase(cur.begin());
			out.push_back(make_pair(p.first%10000,p.second));
		}
		sort(out.begin(),out.end());
		for(auto p:out)cout<<p.second<<"\n";
	}
}