//#include #include //#include using namespace std; //using namespace atcoder; typedef long long ll; typedef long double ld; typedef unsigned int uint; typedef unsigned long long ull; typedef pair p; const int INF = 1e9; const double eps = 1e-7; const ll LINF = ll(1e18); const int MOD = 1000000007; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; const long double pi = 4 * atan(1); #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, vector &v) { for (T &x : v) is >> x; return is; } //cout<> n >> k; priority_queue>>> que; vector>>> v(100000); rep(i, n) { int s, pp, u; cin >> s >> pp >> u; u--; //que.push(make_pair(s,make_pair(-u,make_pair(-pp,i)))); v[u].push_back(make_pair(s, make_pair(-pp, i))); } rep(i, 100000) { if(v[i].size()==0)continue; sort(ALL(v[i])); for (int j = v[i].size() - 1; j >= 0; j--) { int s, pp, l; s = v[i][j].first; pp = v[i][j].second.first; l = v[i][j].second.second; que.push(make_pair(s, make_pair(j-v[i].size(), make_pair(-pp, l)))); } } rep(i, k) { pair>> r = que.top(); que.pop(); cout << r.second.second.second << "\n"; } }