#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int N=1e5+10; int cnt[N];
struct Team { int s,p,u,id; }a[N];
int main() {
  //freopen("icpc.in","r",stdin);
  //freopen("icpc.out","w",stdout);
  int n,k; vector<pair<pair<int,int>,int> >u[N]; priority_queue<pair<pair<pair<int,int>,int>,int> >q;
  scanf("%d %d",&n,&k);
  for(int i=0;i<n;i++) scanf("%d %d %d",&a[i].s,&a[i].p,&a[i].u),a[i].id=i,u[a[i].u].push_back({{a[i].s,-a[i].p},a[i].id});
  for(int i=1;i<N;i++) {
  	if(u[i].empty()) continue;
  	sort(u[i].begin(),u[i].end()); int x=u[i].back().second; u[i].pop_back();
  	//printf("%d %d\n",x,i);
	q.push({{{a[x].s,0},-a[x].p},x});
  }
  while(k--) {
  	//printf("S%d\n",q.size());
  	int x=q.top().second,v=a[x].u; q.pop(),printf("%d\n",x);
  	if(!u[v].empty()) {
  	  cnt[v]++;
  	  int xx=u[v].back().second; u[v].pop_back(); //printf("U%d %d %d %d\n",xx,a[xx].s,cnt[v],a[xx].p);
  	  q.push({{{a[xx].s,-cnt[v]},-a[xx].p},xx});
	}
  }
  return 0;
}