N,Q=map(int,input().split())
assert 1<=N<=100
assert 1<=Q<=100000
beforeuser=set()
beforerate=set()
goodbyeuser=set()
there=[]
for _ in range(Q):
    t,*q=input().split()
    if t=="1":
        assert 0<=int(q[1])<=4000
        assert int(q[1]) not in beforerate
        beforerate.add(int(q[1]))
        assert q[0] not in beforeuser
        beforeuser.add(q[0])
        assert len(beforeuser)<=100
        there.append((int(q[1]),q[0]))
    elif t=="2":
        N-=int(q[0])
    else:
        assert q[0] in beforeuser
        assert q[0] not in goodbyeuser
        N+=int(q[1])
        for i in range(len(there)):
            if there[i][1]==q[0]:
                there[i]=(there[i][0]%998244353+998244353,q[0])
    assert N>=1
    there.sort(reverse=True)
    goodbye=[]
    while len(there)>N:
        goodbyeuser.add(there[-1][1])
        goodbye.append((there[-1][0]%998244353,there[-1][1]))
        there.pop()
    goodbye.sort()
    for i in goodbye:
        print(i[1])