#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int n,kei;

int penalty[100005];
int univ   [100005];
int sucuniv[100005];
int sucuniv_memo[100005];

vector<int> solved[11];

int main(){
    int i,j,k,l;
    
    cin >> n>>kei;
    
    int s,p,u;
    for (i=0;i<n;i++){
        scanf("%d%d%d",&s,&p,&u);
        penalty[i]=p;
        univ[i]=u;
        solved[s].push_back(i);
    }
    sucuniv_memo[0] = n;
    
    for (int sidx=10;0<kei;sidx--){
        if (solved[sidx].size()==0) continue;
        if (solved[sidx].size()<=kei){
            kei -=solved[sidx].size();
            for (int e : solved[sidx]){
                printf("%d\n",e);
                sucuniv_memo[sucuniv[univ[e]]]--;
                sucuniv[univ[e]]++;
                sucuniv_memo[sucuniv[univ[e]]]++;
            }
        }else{
            vector<int> selected;
            for (i=0;i<kei;i++){
                if (sucuniv_memo[i]==0) continue;
                for (int e : solved[sidx]){
                    if (sucuniv[univ[e]]==i){
                        selected.push_back(e);
                    }
                }
                if (selected.size()==kei){
                    // finish
                    for (int e : selected){
                        printf("%d\n",e);
                        sucuniv_memo[sucuniv[univ[e]]]--;
                        sucuniv[univ[e]]++;
                        sucuniv_memo[sucuniv[univ[e]]]++;
                    }
                    kei = 0;
                    break;
                }else if (kei<selected.size()){
                    // step3
                    stable_sort(selected.begin(),selected.end(),[](int l,int r){return penalty[l]<penalty[r];});
                    for (int e : selected){
                        if (--kei<0) break;
                        printf("%d\n",e);
                        sucuniv_memo[sucuniv[univ[e]]]--;
                        sucuniv[univ[e]]++;
                        sucuniv_memo[sucuniv[univ[e]]]++;
                    }
                    break;
                }else{
                    // step2
                    for (int e : selected){
                        printf("%d\n",e);
                        sucuniv_memo[sucuniv[univ[e]]]--;
                        sucuniv[univ[e]]++;
                        sucuniv_memo[sucuniv[univ[e]]]++;
                    }
                    kei -= selected.size();
                    selected.clear();
                    continue;
                }
            }
        }
    }

    return 0;
}