#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<=(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf=1e9;

int N, K;
int S[100010], P[100010], U[100010];
int univ[100010];

int main(){
	cin>>N>>K;
	REP(i,0,N){
		cin>>S[i]>>P[i]>>U[i];
	}

	vector<pair< pair<int,int>, pair<int,int> > > v;
	REP(i,0,N){
		v.push_back({{-S[i],0},{P[i], i}});
	}
	sort(v.begin(), v.end());


	REP(i,0,N){
		univ[U[v[i].S.S]]++;
		v[i].F.S = univ[U[v[i].S.S]];
	}
	sort(v.begin(), v.end());

	REP(i,0,K){
		cout<<v[i].S.S<<endl;
	}

	return 0;
}