#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

struct Team {
	int S, P, U;
};

int main() {
	int N; int K;
	while(~scanf("%d%d", &N, &K)) {
		int M = 0, MaxS = 0;
		vector<Team> teams(N);
		rep(i, N) {
			int S; int P; int U;
			scanf("%d%d%d", &S, &P, &U), -- U;
			amax(M, U + 1);
			amax(MaxS, S);
			teams[i] = { S,P,U };
		}
		vector<vi> byScore(MaxS + 1);
		rep(i, N)
			byScore[teams[i].S].push_back(i);
		vector<vpii> byUniversity(M);
		vector<int> universities;
		priority_queue<pair<ll,int>> pq;
		vector<int> list;
		vector<int> cnt(M, 0);
		for(int s = MaxS; s >= 0; -- s) {
			for(int i : byScore[s]) {
				int u = teams[i].U;
				if(byUniversity[u].empty())
					universities.push_back(u);
				byUniversity[u].emplace_back(teams[i].P, i);
			}
			for(int u : universities) {
				auto &v = byUniversity[u];
				sort(v.rbegin(), v.rend());
				pq.push(make_pair(-((ll)cnt[u] << 32 | v.back().first), u));
			}
			while(!pq.empty()) {
				int u = pq.top().second;
				pq.pop();
				auto &v = byUniversity[u];
				int i = v.back().second;
				list.push_back(i);
				++ cnt[u];
				v.pop_back();
				if(!v.empty())
					pq.push(make_pair(-((ll)cnt[u] << 32 | v.back().first), u));
			}
			universities.clear();
		}
		list.resize(K);
		for(int i = 0; i < K; ++ i)
			printf("%d\n", list[i]);
	}
	return 0;
}