#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

struct ICPC {
	long long s, p, u, num;

	bool operator<(const ICPC& right) const {
		if (s != right.s) return s>right.s;
		return p<right.p;
	}
};

int Univ[100001];

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, k;
	cin >> n >> k;
	vector<ICPC> data;
	for (int i = 0; i < n; i++) {
		int s, p, u; cin >> s >> p >> u;
		ICPC icpc = { s,p,u,i };
		data.push_back(icpc);
	}
	sort(data.begin(), data.end());

	for (int j = 0; j < data.size(); j++) {
		data[j].p += Univ[data[j].u] * (long long)1e7;
		Univ[data[j].u]++;
	}
	sort(data.begin(), data.end());

	for (int j = 0; j < k; j++) {
		cout << data[j].num << endl;
	}

	return 0;
}