#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

int main(){
  int n,k;
  cin>>n>>k;
  vector<vector<int> > solves(11, vector<int>());
  vector<int> s(n), p(n), u(n);

  rep(i,n){
    scanf("%d %d %d", &s[i], &p[i], &u[i]);
    u[i]--;
    solves[s[i]].pb(i);
  }

  vector<int> solved(1000000, 0);

  int cnt=0;

  for(int sol=10; sol>=0; sol--){
    vector<vector<pair<int, int> > > vec(1000000, vector<pair<int, int> >());
    for(int i : solves[sol]){
      vec[u[i]].pb(mp(p[i], i));
    }

    typedef pair<long, int> P;
    #define LLL 10000000
    priority_queue<P, vector<P>, greater<P> > pq;

    rep(i, 1000000) if(vec[i].size()>0){
      sort(all(vec[i]));
      rep(j, vec[i].size()){
        pq.push(mp((long)(solved[i]+j)*LLL + vec[i][j].fi, vec[i][j].se));
      }
    }

    while(!pq.empty() && cnt<k){
      auto pp = pq.top(); pq.pop();
      int i = pp.se;
      printf("%d\n", i);
      solved[u[i]]++;
      cnt++;
    }

  }

  return 0;
}