#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max<R>(x,0.0));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

// Problem Specific Parameter:

using i2=tuple<int,int>;
using i3=tuple<int,int,int>;
int n,k;


const int limit=100000;
int num[limit];
deque<i2> score[11][limit];

int s[100010],p[100010],u[100010];

int main(void){
	cin >> n >> k;
	
	rep(i,n) cin >> s[i] >> p[i] >> u[i],u[i]--;
	rep(i,n) score[s[i]][u[i]].push_back(i2(p[i],i));


	vector<int> ans;
	rrep(i,11){
		set<i3> ss;
		rep(j,limit){
			sort(_all(score[i][j]));
			if(score[i][j].size()>0){
				ss.insert(i3(num[j],get<0>(score[i][j][0]),get<1>(score[i][j][0])));
			}
		}

		while(1){
			if(ss.empty()) break;
			auto it=begin(ss);
			int uu,pp,ii;
			tie(uu,pp,ii)=*it;

			num[u[ii]]++;

			score[i][u[ii]].pop_front();
			ans.push_back(ii);
			ss.erase(it);

			
			if(score[i][u[ii]].empty()==false) ss.insert(i3(num[u[ii]],get<0>(score[i][u[ii]][0]),get<1>(score[i][u[ii]][0])));
		}

	}

	rep(i,k) cout << ans[i] << endl;
	return 0;
}