#include <bits/stdc++.h>

using namespace std;

int main()
{
  int N, K;
  int S[100000], P[100000], U[100000];
  deque< tuple< int, int, int > > team[100001];
  int ct[100001] = {};

  cin >> N >> K;
  for(int i = 0; i < N; i++) {
    cin >> S[i] >> P[i] >> U[i];
    team[U[i]].emplace_back(-S[i], P[i], i);
  }

  set< tuple< int, int, int, int, int > > pp;
  for(int i = 0; i < 100001; i++) {
    if(team[i].empty()) continue;
    sort(begin(team[i]), end(team[i]));
    int a, b, c;
    tie(a, b, c) = team[i][0];
    team[i].pop_front();
    pp.emplace(a, ct[i]++, b, i, c);
  }
  for(int i = 0; i < K; i++) {
    int a, b, c, d, e;
    tie(a, b, c, d, e) = *pp.begin();
    cout << e << endl;
    pp.erase(pp.begin());
    if(!team[d].empty()) {
      int x, y, z;
      tie(x, y, z) = team[d][0];
      team[d].pop_front();
      pp.emplace(x, ct[d]++, y, d, z);
    }
  }
}