#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>s(n), p(n), u(n);
	vector<vector<array<int, 3>>> e(100005);
	rep(i, n) {
		cin >> s[i] >> p[i] >> u[i];
		u[i]--;
		e[u[i]].push_back({ s[i], -p[i], i });
	}
	priority_queue<array<int, 4>> pq;
	rep(i, 100005) if (!e[i].empty()) {
		sort(allR(e[i]));
		rep(j, e[i].size()) {
			int x = e[i][j][2];
			pq.push({ s[x], -j, -p[x], x });
		}
	}
	while (k--) {
		auto top = pq.top();
		pq.pop();
		cout << top[3] << endl;
	}
	return 0;
}