/* -*- coding: utf-8 -*-
 *
 * 433.cc: No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_S = 10;
const int MAX_U = 100000;

/* typedef */

struct Team {
  int s, w, p, i;
  Team() {}
  Team(int _s, int _w, int _p, int _i): s(_s), w(_w), p(_p), i(_i) {}

  bool operator<(const Team &t) const {
    return
      (s > t.s || (s == t.s && (w < t.w || (w == t.w && p < t.p))));
  }
};

typedef vector<Team> vtm;
typedef set<Team> stm;

/* global variables */

vtm uts[MAX_U];

/* subroutines */

/* main */

int main() {
  int n, k;
  cin >> n >> k;

  for (int i = 0; i < n; i++) {
    int si, pi, ui;
    cin >> si >> pi >> ui;
    ui--;
    uts[ui].push_back(Team(si, 0, pi, i));
  }

  stm tms;
  
  for (int u = 0; u < MAX_U; u++) {
    int un = uts[u].size();
    sort(uts[u].begin(), uts[u].end());
    for (int i = 0; i < un; i++) {
      uts[u][i].w = i;
      tms.insert(uts[u][i]);
    }
  }

  for (stm::iterator sit = tms.begin(); k-- > 0 && sit != tms.end(); sit++)
    printf("%d\n", sit->i);
  return 0;
}