#include using namespace std; using ll = int64_t; using P = std::pair; const int INF = 1e8; struct T { int s, p, u; int index; int rank; T(int _s, int _p, int _u, int _index) { s = _s; p = _p; u = _u; index = _index; } bool operator<(const T &x) { if(x.s > s) { return false; } if(x.s < s) { return true; } if(x.s == s) { if(x.p < p) { return false; } else { return true; } } } void print() { cout << s << ' ' << u << ' ' << p << ' ' << index << endl; } }; struct greater_standing { bool operator() (const T &x, const T &y) const { if(x.s > y.s) { return false; } if(x.s < y.s) { return true; } if(x.s == y.s) { if(x.rank > y.rank) { return true; } if(x.rank < y.rank) { return false; } if(x.rank == y.rank) { if(x.p > y.p) { return false; } else { return true; } } } } }; int main() { ios::sync_with_stdio(false); int N, K; int S, P, U; cin >> N >> K; vector v; vector name; map conv; for(int i = 0; i < N; i++) { cin >> S >> P >> U; v.emplace_back(T(S, P, U, i)); name.emplace_back(U); } sort(name.begin(), name.end()); name.erase(unique(name.begin(), name.end()), name.end()); for(int i = 0; i < name.size(); i++) { conv[name[i]] = i; } vector w[name.size()]; for(int i = 0; i < N; i++) { w[conv[v[i].u]].push_back(v[i]); } priority_queue, greater_standing> queue; for(int i = 0; i < name.size(); i++) { sort(w[i].begin(), w[i].end()); for(int j = 0; j < w[i].size(); j++) { // w[i][j].print() w[i][j].rank = j; queue.push(w[i][j]); } } int c = 0; while(c < K) { T a = queue.top(); cout << a.index << endl; queue.pop(); c++; } }