#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

int s[100010], p[100010], u[100010], r[100010], id[100010];

int main() {
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> s[i] >> p[i] >> u[i];
    }
    iota(id, id + n, 0);
    sort(id, id + n, [&](int a, int b) {
        return make_tuple(-s[a], p[a]) < make_tuple(-s[b], p[b]);
    });
    map<int, int> univ_cnt;
    for (int i = 0; i < n; i++) {
        r[id[i]] = univ_cnt[u[id[i]]];
        ++univ_cnt[u[id[i]]];
    }
    sort(id, id + n, [&](int a, int b) {
        return make_tuple(-s[a], r[a], p[a]) < make_tuple(-s[b], r[b], p[b]);
    });
    for (int i = 0; i < k; i++) {
        cout << id[i] << '\n';
    }
}