#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,K;
struct Team {
    int i,s,r,p,u;
    Team():i(0),s(0),r(0),p(0),u(0){};
    
    bool operator < (const Team &t) const {
        if (s != t.s) return s < t.s;
        if (r != t.r) return r > t.r;
        return p > t.p;
    }
};
vector<Team> U[SIZE];

priority_queue<Team> que;

void solve() {
    cin>>N>>K;
    REP(i,N) {
        auto t = *new Team();
        cin>>t.s>>t.p>>t.u;
        t.i = i;
        U[t.u].push_back(t);
    }
    REP(i,SIZE)if(U[i].size()) {
        sort(ALL(U[i]));
        reverse(ALL(U[i]));
        REP(j,U[i].size()) {
            U[i][j].r = j;
            que.push(U[i][j]);
        }
    }
    while(K--) {
        auto t = que.top();
        que.pop();
        cout << t.i << endl;
    }
}