from heapq import *

N, K = map(int, input().split())
SPU = [tuple(map(int, input().split()))+(i,) for i in range(N)]
SPU.sort(key=lambda k: (-k[0], k[1]))
SPU += [(-1, -1, -1, -1)]
pq = []
cnt = [0]*N
ans = []

for i in range(N):
    Si, Pi, Ui, idx = SPU[i]
    heappush(pq, (cnt[Ui], Pi, idx))
    cnt[Ui] += 1
    
    if SPU[i][0]!=SPU[i+1][0]:
        while pq:
            _, _, idx = heappop(pq)
            ans.append(idx)
            
            if len(ans)>=K:
                for ans_i in ans:
                    print(ans_i)
                
                exit()