#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<tuple<int, int, int, int>> SPU;   //解いた問題で云々
map<int, set<tuple<int, int, int, int>>> ac;  //(正答数, SPU)
map<int, set<tuple<int, int, int, int>>> school;    //(学校, SPU)
map<int, set<tuple<int, int, int, int>>> pena;    //(ペナ数, SPU)
vector<int> sccnt;
set<int> used;

int main(void) {
    cin >> N >> K;
    SPU.resize(N);
    sccnt.resize(N, 0);
    REP(i, N) {
        int s, p, u;
        cin >> s >> p >> u;
        auto tt = make_tuple(s, p, u, i);
        SPU[i] = tt;
        ac[s].emplace(tt);
        school[u].emplace(tt);
        pena[p].emplace(tt);
    }
    SORT(SPU);REVERSE(SPU);
    REP(_, K) {
        auto itr = ac.end();
        itr--;
        if ((*itr).second.size() == 0) {
            ac.erase(itr);
            itr = ac.end();
            itr--;
        }
        if ((*itr).second.size() == 1) {
            int s,p,u,n;
            FORE(el, (*itr).second) {
                cout << get<3>(el) << endl;
                //DEBUG("AC数")
                tie(s, p, u, n) = el;
            }
            sccnt[u]++;
            ac[s].erase(make_tuple(s, p, u, n));
            school[u].erase(make_tuple(s, p, u, n));
            pena[p].erase(make_tuple(s, p, u, n));
        } else {
            //学校からの突破数で比較
            int s, p, u, n;
            int mokuhyonum = INF;
            set<tuple<int, int, int, int>> se;
            FORE(el, (*itr).second) {
                tie(s, p, u, n) = el;
                if (mokuhyonum > sccnt[u]) {
                    se.clear(); se.insert(el);
                    mokuhyonum = sccnt[u];
                } else if (mokuhyonum == sccnt[u]) {
                    se.insert(el);
                }
            }
            if (se.size() == 1) {
                FORE(el, se) {
                    cout << get<3>(el) << endl;
                    //DEBUG("school数")
                    tie(s, p, u, n) = el;
                    sccnt[u]++;
                    ac[s].erase(make_tuple(s, p, u, n));
                    school[u].erase(make_tuple(s, p, u, n));
                    pena[p].erase(make_tuple(s, p, u, n));
                }
            } else {
                //ペナ数で比較
                int s, p, u, n;
                int minpena = INF;
                tuple<int, int, int, int> ans;
                FORE(el, se) {
                    tie(s, p, u, n) = el;
                    if (minpena > p) {
                        minpena = p;
                        ans = el;
                    }
                }
                cout << get<3>(ans) << endl;
                //DEBUG("pena数")
                tie(s, p, u, n) = ans;
                sccnt[u]++;
                ac[s].erase(make_tuple(s, p, u, n));
                school[u].erase(make_tuple(s, p, u, n));
                pena[p].erase(make_tuple(s, p, u, n));
            }
        }
    }
}