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

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

	bool operator<(const ICPC& right) const {
		return s == right.s ? p < right.p : s > right.s;
	}
};
int Univ[100001];

int main()
{
	int n, k;
	cin >> n >> k;
	vector<ICPC>raw_data(n);
	for (int i = 0; i < n; i++) {
		cin >> raw_data[i].s >> raw_data[i].p >> raw_data[i].u;
		raw_data[i].num = i;
	}
	vector<ICPC>data(raw_data);
	sort(data.begin(), data.end());

	for (int i = 0; i < k; i++) {
		int solved = data[0].s;
		vector<pair<int,pair<int,int> > > Univ_pena;
		for (int j = 0; j<data.size() && data[j].s == solved;j++) {
			Univ_pena.push_back(make_pair(Univ[data[j].u],make_pair(data[j].p,data[j].num)));
		}
		sort(Univ_pena.begin(), Univ_pena.end());

		int university = Univ_pena[0].first;
		vector<pair<int,int> > pena;
		for (int l = 0; l<Univ_pena.size() && Univ_pena[l].first == university; l++) {
			pena.push_back(Univ_pena[l].second);
		}
		sort(pena.begin(), pena.end());

		cout << pena[0].second << endl;
		Univ[raw_data[pena[0].second].u]++;
		for (int j = 0; j < data.size(); j++) {
			if (data[j].num == pena[0].second) {
				data.erase(data.begin() + j);
				break;
			}
		}
	}

    return 0;
}