#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,k;
pair<pii,int> arr[125252];
vector<pair<pii,int>> brr[125252];
int cnt[125252];

int main(){
  scanf("%d%d",&n,&k);
  set<int> S;
  REP(i,n){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    arr[i] = make_pair(pii(a,b),c);
    S.insert(c);
  }
  map<int,int> M;
  int m=0;
  for(int x:S){
    M[x] = m++;
  }
  REP(i,n)arr[i].second = M[arr[i].second];
  REP(i,n){
    int o = arr[i].second;
    pii p = arr[i].first;
    p.first *= -1;
    brr[o].push_back(make_pair(p,i));
  }
  REP(i,m)sort(ALL(brr[i]));
  set< pair<pii,pii> > EK;
  REP(i,m){
    cnt[i] = 0;
    EK.insert(make_pair(pii(brr[i][0].first.first,cnt[i]),pii(brr[i][0].first.second,i)));
  }
  REP(i,k){
    auto P = *EK.begin();
    EK.erase(EK.begin());
    int zoku = P.second.second;
    printf("%d\n",brr[zoku][cnt[zoku]].second);
    cnt[zoku] += 1;
    if(cnt[zoku] < brr[zoku].size()){
      int id = cnt[zoku];
    EK.insert(make_pair(pii(brr[zoku][id].first.first,cnt[zoku]),pii(brr[zoku][id].first.second,zoku)));
    }
  }
  return 0;
}