#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

constexpr ll mod = 1e9+7;

int main(){
    using P4 = tuple<int,int,int,int>;
    using P3 = tuple<int,int,int>;
    int n,k;
    cin>>n>>k;
    vector<vector<P3>> Univ(10);
    rep(i,n){
        int s,p,u;cin>>s>>p>>u;
        u--;
        Univ[u].push_back(P3(s,-p,i));
    }
    priority_queue<P4> que;
    rep(i,10) if(Univ[i].size()){
        sort(all(Univ[i]));
        reverse(all(Univ[i]));
        for(int j=0;j<Univ[i].size();j++){
            int s,p,idx;
            tie(s,p,idx) = Univ[i][j];
            que.push(P4(s,-j,p,idx));
        }
    }

    rep(i,k){
        int s,u,p,x;
        tie(s,u,p,x) = que.top();
        que.pop();
        cout << x << endl;
    }
}