package main import ( "bufio" "fmt" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } type team struct { s, p, u int cnt int idx int } func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) // this template is new version. // use getI(), getS(), getInts(), getF() N, K := getI(), getI() t := make([]team, N) for i := 0; i < N; i++ { t[i] = team{getI(), getI(), getI(), 0, i} } sort.Slice(t, func(i, j int) bool { if t[i].s == t[j].s { return t[i].p < t[j].p } return t[i].s > t[j].s }) p := make([]int, N+1) for i := 0; i < N; i++ { u := t[i].u t[i].cnt = p[u] p[u]++ } sort.Slice(t, func(i, j int) bool { if t[i].s == t[j].s { if t[i].cnt == t[j].cnt { return t[i].p < t[j].p } return t[i].cnt < t[j].cnt } return t[i].s > t[j].s }) for i := 0; i < K; i++ { out(t[i].idx) } }