// yukicoder 433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
// 2019.8.10 bal4u

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) { // 非負整数の表示（出力）
	int i;
	char b[20];

	if (!n) pc('0');
	else {
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

int N, K;
typedef struct { int id, s, p, u; } T;
T a[100005];
T b[100005]; int sz;
int f[1000005];

int cmpsp(const void *u, const void *v) {
	int t; if (t = ((T *)v)->s - ((T *)u)->s) return t;
	return ((T *)u)->p - ((T *)v)->p;
}

int cmpup(const void *u, const void *v) {
	int t; if (t = ((T *)u)->s - ((T *)v)->s) return t;
	return ((T *)u)->p - ((T *)v)->p;
}

int select(int s, int i) {
	int j;
	sz = 0;
	while (i < N && a[i].s == s) {
		b[sz].s = f[a[i].u]++, b[sz].p = a[i].p, b[sz].id = a[i].id;
		sz++, i++;
	}
	qsort(b, sz, sizeof(T), cmpup);
	for (j = 0; K && j < sz; j++) out(b[j].id), K--;
	return i;
}

int main()
{
	int i;
	
	N = in(), K = in();
	for (i = 0; i < N; i++) {
		a[i].id = i, a[i].s = in(), a[i].p = in(), a[i].u = in();
	}
	qsort(a, N, sizeof(T), cmpsp);
	i = 0; while (K) i = select(a[i].s, i);
	return 0;
}