package main

import . "fmt"
import . "os"
import bf "bufio"
import . "sort"

func main() {
	rd := bf.NewReader(Stdin)
	var n, q int
	Fscan(rd, &n,&q)
	members := make([]*Member, 0, n)
	fa := map[string]*Member{}

	for i := 0; i < q; i++ {
		var t int
		Fscan(rd, &t)
		switch t {
			case 1:
				m := new(Member)
				Fscan(rd, &m.name, &m.rating)
				members = append(members, m)
				fa[m.name] = m
			case 2:
				var dec int
				Fscan(rd, &dec)
				n -= dec
			case 3:
				var name string
				var inc int
				Fscan(rd, &name, &inc)
				fa[name].goodjob = true
				n += inc
		}
		if len(members) <= n {
			continue
		}
		Slice(members, func(i, j int) bool {
			m1, m2 := members[i], members[j]
			if m1.goodjob != m2.goodjob {
				return m1.goodjob
			} else {
				return m1.rating > m2.rating
			}
		})
		for len(members) > n {
			e := len(members)-1
			Println(members[e].name)
			members = members[:e]
		}
	}
}

type Member struct {
	name string
	rating int
	goodjob bool
}