#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <random>

#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int (i) = (a) - 1; (i) >= (b); (i)--)
#define PI acos(-1.0)
#define DEBUG(C) cerr << C << endl;
#define VI vector <int>
#define VII vector <VI>
#define VL vector <LL>
#define VLL vector <VL>
#define VD vector <double>
#define VDD vector <VD>
#define PII pair <int, int>
#define PDD pair <double, double>
#define PLL pair <LL, LL>
#define VPII vector <PII>
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EB emplace_back
#define FORE(a, b) for (auto &&a : b)
#define FIND(s, n) (s.find(n) != s.end())

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

int N, K;
vector<vector<tuple<int, int, int>>> uni;
vector<tuple<int, int, int, int, int>> PKUn;

int main(void) {
    cin >> N >> K;
    uni.resize(N);
    PKUn.resize(N);
    REP(i, N) {
        int s, p, u;
        scanf("%d%d%d", &s, &p, &u);
        uni[u].EB(make_tuple(s, -p, i));
        PKUn[i] = (make_tuple(s, -1, -p, u, i));
    }
    REP(i, N) if (uni[i].size()) {
        SORT(uni[i]);REVERSE(uni[i]);
        int cnt = 0;
        REP(j, uni[i].size()) {
            int s, r, p, u, id;
            tie(s,p,id) = uni[i][j];
            tie(s,r,p,u,id) = PKUn[id];
            r = cnt++;
            PKUn[id] = make_tuple(s,-r,p,u,id);
        }
    }
    SORT(PKUn); REVERSE(PKUn);
    REP(i, K) {
        cout << get<4>(PKUn[i]) << endl;
    }
}