import java.io.*; import java.math.*; import java.util.*; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int N = io.nextInt(); int K = io.nextInt(); TreeMap mp = new TreeMap<>(); TreeMap> mp2 = new TreeMap<>(); for (int i = 0; i < N; i++) { Team t = new Team(); t.s = io.nextInt(); t.p = io.nextInt(); t.u = io.nextInt(); t.i = i; if(!mp.containsKey(t.u)) { mp.put(t.u, mp.size()); } t.u = mp.get(t.u); TreeSet ts = mp2.get(t.u); if(ts == null) ts = new TreeSet<>(); ts.add(t); mp2.put(t.u, ts); } long[] cnt = new long[mp.size()]; Seg2 seg = new Seg2(mp.size()); for(int i = 0; i < mp.size(); i++) { // dump(i + " " + mp2.get(i).first().val(0)); // dump(i + " " + mp2.get(i).first().s + " " + mp2.get(i).first().s); seg.update(i, mp2.get(i).first().val(0)); } for(int i = 0; i < K; i++) { int idx = seg.get(0, mp.size()); // dump(i, idx); io.out.println(mp2.get(idx).pollFirst().i); cnt[idx]++; if(!mp2.get(idx).isEmpty()) { // dump(idx + " " + mp2.get(idx).first().val(cnt[idx])); seg.update(idx, mp2.get(idx).first().val(cnt[idx])); } else { // dump(idx + " " + -1); seg.update(idx, -1); } } } } static class Team implements Comparable { int s, p, u, i; long val(long c) { return (long)s<<58 | (200000-c)<<30 | ((1<<29)-p); } @Override public int compareTo(Team arg0) { // TODO Auto-generated method stub return -Long.compare(val(0), arg0.val(0)); } } static class Seg2 { final int n; final int[] idx; final long[] seg; public Seg2(final int n) { this.n = Integer.highestOneBit(n) << 1; seg = new long[this.n << 1]; idx = new int[this.n << 1]; Arrays.fill(seg, -(1L<<60)); } int get(int l, int r) { return get(l, r, 0, 0, n); } int get(int l, int r, int k, int curL, int curR) { if(curR <= l || curL >= r) return -1; if(l <= curL && curR <= r) { return idx[k]; } final int curM = (curL + curR) / 2; int ll = get(l, r, 2 * k + 1, curL, curM); int rr = get(l, r, 2 * k + 2, curM, curR); // dump(l, r, k, curL, curR, ll, rr, n); if(ll == -1) return rr; if(rr == -1) return ll; return seg[ll + n - 1] > seg[rr + n - 1] ? ll : rr; } void update(int i, long v) { i += n - 1; seg[i] = v; idx[i] = i - (n - 1); while(i != 0) { i = (i - 1) / 2; seg[i] = Math.max(seg[2*i+1], seg[2*i+2]); idx[i] = (seg[2*i+1] > seg[2*i+2] ? idx[2*i+1] : idx[2*i+2]); } } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } // public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }