package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r:rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			result = append(result, v)
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	result = append(result, v)

	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}

type Team struct {
	Solve   int
	Penalty int
	Univ    int
	Upper   int
	Index   int
}

var sortMode = 0

type SortInterFace []Team

func (s SortInterFace) Len() int {
	return len(s)
}
func (s SortInterFace) Less(i, j int) bool {
	if sortMode == 0 {
		if s[i].Solve != s[j].Solve {
			return s[i].Solve > s[j].Solve
		}
		return s[i].Penalty < s[j].Penalty
	} else {
		if s[i].Solve != s[j].Solve {
			return s[i].Solve > s[j].Solve
		}
		if s[i].Upper != s[j].Upper {
			return s[i].Upper < s[j].Upper
		}
		return s[i].Penalty < s[j].Penalty
	}
}
func (s SortInterFace) Swap(i, j int) {
	s[i], s[j] = s[j], s[i]
}

func main() {
	sc := NewScanner()
	N, K := sc.NextInt(), sc.NextInt()

	mp := map[int]int{}

	teams := make(SortInterFace, N)
	for i := 0; i < N; i++ {
		teams[i] = Team{sc.NextInt(), sc.NextInt(), sc.NextInt(), 0, 0}
		teams[i].Index = i
	}

	sort.Sort(teams)
	for i := 0; i < N; i++ {
		mp[teams[i].Univ]++
		teams[i].Upper = mp[teams[i].Univ]
	}
	sortMode = 1
	sort.Sort(teams)
	for i := 0; i < K; i++ {
		fmt.Println(teams[i].Index)
	}
}