#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
typedef pair<int,P> PP;
typedef pair<P,PP> P2;

void Main() {
  int n,m;
  cin >> n >> m;
  priority_queue<PP,vector<PP>,greater<PP> > v[111111];
  rep(i,n) {
    int x,y,z;
    cin >> x >> y >> z;
    v[z].push(PP(-x,P(y,i)));
  }
  priority_queue<P2,vector<P2>,greater<P2> > que;
  int c[111111];
  mem(c);
  rep(i,111111) {
    if(!v[i].empty()) {
      PP p=v[i].top();v[i].pop();
      que.push(P2(P(p.F,c[i]),PP(p.S.F,P(i,p.S.S))));
    }
  }
  int k=0;
  while(k<m&&!que.empty()) {
    P2 pp=que.top();que.pop();
    pr(pp.S.S.S);
    k++;
    c[pp.S.S.F]++;
    if(!v[pp.S.S.F].empty()) {
      PP p=v[pp.S.S.F].top();v[pp.S.S.F].pop();
      que.push(P2(P(p.F,c[pp.S.S.F]),PP(p.S.F,P(pp.S.S.F,p.S.S))));
    } 
  }
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}