#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <array>
#include <cmath>

#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()

using namespace std;
typedef long long ll; 
typedef array<int, 5> A5;

int main()
{
	
	cin.tie(0); ios_base::sync_with_stdio(false);
	int n, k;
	cin >> n >> k;
	vector<A5> dt(n);
	rep(i,n){
		cin >> dt[i][0] >> dt[i][1] >> dt[i][2] ;
		dt[i][3] = i;
	}
	sort(all(dt),[](A5 l,A5 r){
		return l[2] !=r[2]? l[2] < r[2]: l[0] !=r[0]? l[0] > r[0] : l[1] < r[1];
	});
	dt[0][4]=1;
	rep(i,n-1) dt[i+1][4] = (dt[i][2] == dt[i+1][2])?  dt[i][4] + 1: 1;

	//for(auto xl: dt){for(auto x :xl) printf("%d: ",x); puts("");}
	sort(all(dt),[](A5 l,A5 r){
		return l[0] !=r[0]? l[0] > r[0]: l[4] !=r[4]? l[4] < r[4] : l[1] < r[1];
	});
	//for(auto xl: dt){for(auto x :xl) printf("%d: ",x); puts("");}

	rep(i,k) cout << dt[i][3] <<"\n";
	return 0;
}