#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

template<typename T> class RPQ : public PQ<T, vector<T>, greater<T>> { };

int n, k;
RPQ<array<int, 2>> pq[11][100000];
RPQ<array<int, 4>> pq2;
int num[100000];
vector<int> ans;

void pick(int s, int u) {
	if(! pq[s][u].empty()) {
		auto e = pq[s][u].top(); pq[s][u].pop();
		int p = e[0];
		int i = e[1];
		pq2.push({ num[u], p, u, i });
	}
}

int main() {
	cin >> n >> k;
	inc(i, n) {
		int s, p, u;
		cin >> s >> p >> u;
		u--;
		pq[s][u].push({ p, i });
		
	}
	
	dec(s, 11) {
		inc(u, 100000) { pick(s, u); }
		while(! pq2.empty()) {
			auto e = pq2.top(); pq2.pop();
			int u = e[2];
			int i = e[3];
			num[u]++;
			ans.PB(i);
			pick(s, u);
		}
	}
	
	inc(i, k) { cout << ans[i] << "\n"; }
	
	return 0;
}