from heapq import*
class Heapq:
 def __init__(self,a=[]):self.q,self.p=a,[];heapify(self.q)
 def push(self,x):heappush(self.q,x)
 def erase(self,x):heappush(self.p,x)
 def clean(self):
  while self.p and self.q[0]==self.p[0]:heappop(self.q);heappop(self.p)
 def pop(self,exc=None):return heappop(self.q)if self.clean()or self.q else exc
 def top(self,exc=None):return self.q[0]if self.clean()or self.q else exc
 def __len__(self):return len(self.q)-len(self.p)
n,Q=map(int,input().split())
ps=Heapq([])
qs=Heapq([])
p=set()
d={}
for _ in range(Q):
  k,s,*r=input().split()
  if k=='1':
    r=int(r[0])
    ps.push((r,s))
    p|={s}
    d[s]=r
  if k=='2':
    x=int(s)
    n-=x
  if k=='3':
    x=int(r[0])
    n+=x
    if s in p:
      ps.erase((d[s],s))
      qs.push((d[s],s))
      p.discard(s)
  # print(n,k,s,r,ps.p,ps.q,qs.p,qs.q)
  while len(qs)>n:
    r,s=qs.pop()
    print(s)
  while len(ps)>n-len(qs):
    r,s=ps.pop()
    print(s)