#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define mt make_tuple

// solved, -penalty, id
vector<tuple<int, int, int>> univ[100001];
int idx[100001];

int main(){
    int N, K;
    cin >> N >> K;
    vi S(N), P(N), U(N);
    rep(i, N) {
        scanf("%d%d%d", &S[i], &P[i], &U[i]);
        univ[U[i]].emplace_back(-S[i], +P[i], i);
    }
    rep(i, 100001) {
        sort(all(univ[i]));
    }

    // +solved, -others, -penalty, univ, id
    priority_queue<tuple<int, int, int, int, int> > Q;
    rep(i, 100001) {
        if(sz(univ[i])) {
            int s, p, k;
            tie(s, p, k) = univ[i][0];
            Q.push(mt(-s, 0, -p, i, k));
        }
    }

    rep(i, K) {
        int s, cnt, p, uni, id;
        tie(s, cnt, p, uni, id) = Q.top();
        Q.pop();
        printf("%d\n", id);
        idx[uni]++;
        if(idx[uni] < sz(univ[uni])) {
            tie(s, p, id) = univ[uni][idx[uni]];
            Q.push(mt(-s, cnt - 1, -p, uni, id));
        }
    }
}