#include <bits/stdc++.h> using namespace std; template<class T> using pqueue = priority_queue<T, vector<T>, greater<T>>; int main() { int N, K; cin >> N >> K; vector<int> S(N), P(N), U(N); vector<vector<int>> ls(11); for (int i = 0; i < N; i++) { scanf("%d %d %d", &S[i], &P[i], &U[i]); U[i]--; ls[S[i]].push_back(i); } vector<int> ord; vector<int> num(100000); for (int k = 10; k >= 0; k--) { vector<int> ptr(100000); vector<vector<pair<int, int>>> ll(100000); for (int id : ls[k]) { ll[U[id]].emplace_back(P[id], id); } pqueue<tuple<int, int, int>> q; for (int i = 0; i < 100000; i++) { if (!ll[i].empty()) { sort(ll[i].begin(), ll[i].end()); q.emplace(num[i], ll[i][0].first, ll[i][0].second); } } while (!q.empty()) { int id = get<2>(q.top()); q.pop(); int uid = U[id]; ord.push_back(id); ptr[uid]++; num[uid]++; if (ptr[uid] < ll[uid].size()) { q.emplace(num[uid], ll[uid][ptr[uid]].first, ll[uid][ptr[uid]].second); } } } ord.resize(K); for (int i = 0; i < K; i++) { cout << ord[i] << endl; } }