#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  Int n,k;
  cin>>n>>k;
  vector<Int> s(n),p(n),u(n);
  for(Int i=0;i<n;i++) cin>>s[i]>>p[i]>>u[i];

  vector<vector<Int> > G(11);
  for(Int i=0;i<n;i++) G[s[i]].emplace_back(i);

  const Int MAX = 114514;
  vector<Int> cnt(MAX,0);
  for(Int x=10;x>=0;x--){
    using T = tuple<Int, Int, Int>;
    using PQ = priority_queue<T, vector<T>, greater<T> >;
    vector<PQ> pqs(MAX);
    PQ all;
    for(Int i:G[x])
      pqs[u[i]].emplace(cnt[u[i]],p[i],i);
    
    for(PQ &pq: pqs){
      if(pq.empty()) continue;
      all.emplace(pq.top());
      pq.pop();
    }
    while(k&&!all.empty()){
      k--;
      Int i;
      tie(ignore,ignore,i)=all.top();all.pop();
      cout<<i<<endl;
      cnt[u[i]]++;
      auto &pq=pqs[u[i]];
      if(pq.empty()) continue;
      tie(ignore,ignore,i)=pq.top();pq.pop();
      all.emplace(cnt[u[i]],p[i],i);
    }
  }
  
  return 0;
}