from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n,k=MI()
    spu=LLI(n)
    hp=[]
    uni=defaultdict(int)
    for i,(s,p,u) in enumerate(spu):
        heappush(hp,(-s,u,p,i))
    while 1:
        s,u,p,i=heappop(hp)
        score=s
        cur=defaultdict(list)
        heappush(cur[u],(p,i))
        while hp[0][0]==score:
            s, u, p, i = heappop(hp)
            heappush(cur[u], (p, i))
        cpi=[]
        for u,pi in cur.items():
            while pi:
                p,i=heappop(pi)
                c=uni[u]
                uni[u]+=1
                heappush(cpi,(c,p,i))
        while cpi:
            c,p,i=heappop(cpi)
            print(i)
            k-=1
            if k==0:exit()

main()