import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

from collections import defaultdict

n, q = LI()
mem = defaultdict(int)
rr = defaultdict(int)
for _ in range(q):
    t, *sr = SI().split()
    if t == "1":
        s, r = sr
        mem[s] = 1
        rr[s] = int(r)
    if t == "2":
        x = int(sr[0])
        n -= x
    if t == "3":
        s, x = sr
        mem[s] = 2
        n += int(x)
    mr = [(mem[s], rr[s], s) for s in mem if mem[s]]
    mr.sort(reverse=True)
    now = []
    while len(mr) > n:
        _, _, s = mr.pop()
        now.append(s)
        mem[s]=0
    now.sort(key=lambda s: rr[s])
    for s in now: print(s)