#include <iostream>
#include <queue>
#include <vector>
#include <tuple>
using namespace std;
typedef tuple<int,int,int> T3;//Solve,-penalty,teamid
priority_queue<T3> Univ[100001];
int Univteam[100001];
typedef tuple<int,int,int,int,int> T5;//Solve,-univteam,-penalty,univid,teamid
priority_queue<T5> que;
int main(){
    int N,K;
    cin>>N>>K;
    for(int i=0;i<N;i++){
        int S,P,U;
        cin>>S>>P>>U;
        Univ[U].emplace(S,-P,i);
    }
    for(int i=0;i<=100000;i++){
        if(!Univ[i].empty()){
            auto t=Univ[i].top(); Univ[i].pop();
            que.emplace(get<0>(t),Univteam[i]--,get<1>(t),i,get<2>(t));
        }
    }
    for(int i=0;i<K;i++){
        auto t=que.top(); que.pop();
        cout<<get<4>(t)<<endl;
        int univid=get<3>(t);
        if(!Univ[univid].empty()){
            auto tt=Univ[univid].top(); Univ[univid].pop();
            que.emplace(get<0>(tt),Univteam[univid]--,get<1>(tt),univid,get<2>(tt));
        }
    }
    return 0;
}