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

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

	bool operator<(const ICPC& right) const {
		return u == right.u ? s < right.s : u < right.u;
	}
};

int Univ[100000];

int main()
{
	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 = { 10-s,p,u,i };
		data.push_back(icpc);
	}
	sort(data.begin(), data.end());

	vector<pair<int,int> > pe_sort[11];
	for (int j = 0; j < data.size(); j++) {
		pe_sort[data[j].s].push_back(make_pair(data[j].p + Univ[data[j].u]*(int)1e6, data[j].num));
		Univ[data[j].u]++;
	}

	for (int i = 0; i < 11; i++) {
		sort(pe_sort[i].begin(), pe_sort[i].end());
	}

	int cnt = 0;
	for (int i = 0; i <11 ; i++) {
		for (int j = 0; j < pe_sort[i].size();j++) {
			cout << pe_sort[i][j].second << endl;
			cnt++;
			if (cnt == k) return 0;
		}
	}

    return 0;
}