package contest161014; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), K = ni(); int[][] ds = new int[n][]; for(int i = 0;i < n;i++){ ds[i] = new int[]{ni(), ni(), ni(), i}; } Arrays.sort(ds, new Comparator() { public int compare(int[] a, int[] b) { if(a[0] != b[0])return -(a[0] - b[0]); return a[1] - b[1]; } }); int sel = 0; int[] uc = new int[100001]; for(int i = 0;i < n;){ int j = i; while(j < n && ds[i][0] == ds[j][0])j++; if(sel + j-i <= K){ for(int k = i;k < j;k++){ uc[ds[k][2]]++; out.println(ds[k][3]); sel++; } }else{ int[] ap = new int[100001]; Arrays.fill(ap, 999999999); for(int k = i;k < j;k++){ ap[ds[k][2]] = uc[ds[k][2]]; } int[] h = new int[100001]; int[] next = new int[n]; Arrays.fill(next, -1); Arrays.fill(h, -1); for(int k = j-1;k >= i;k--){ next[k] = h[ds[k][2]]; h[ds[k][2]] = k; } int[] temp = new int[100001]; int[] temp2 = new int[100001]; SegmentTreeRMQPos st = new SegmentTreeRMQPos(ap); while(sel < K){ int p = 0; int min = st.st[1]; while(true){ int lmin = st.st[1]; if(lmin != min)break; temp[p] = st.pos[1]; temp2[p] = h[st.pos[1]]; h[st.pos[1]] = next[temp2[p]]; p++; st.update(st.pos[1], min+1); } Arrays.sort(temp2, 0, p); for(int k = 0;k < p;k++){ out.println(ds[temp2[k]][3]); if(++sel == K)break; } } break; } i = j; } } public static class SegmentTreeRMQPos { public int M, H, N; public int[] st; public int[] pos; public SegmentTreeRMQPos(int n) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++)pos[H+i] = i; Arrays.fill(st, 0, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public SegmentTreeRMQPos(int[] a) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; pos[H+i] = i; } Arrays.fill(st, H+N, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public void update(int pos, int x) { st[H+pos] = x; for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { if(st[2*i] <= st[2*i+1]){ st[i] = st[2*i]; pos[i] = pos[2*i]; }else{ st[i] = st[2*i+1]; pos[i] = pos[2*i+1]; } } public int minpos; public int minval; public int minx(int l, int r){ if(l >= r)return 0; minval = Integer.MAX_VALUE; minpos = -1; while(l != 0){ int f = l&-l; if(l+f > r)break; int v = st[(H+l)/f]; if(v < minval){ minval = v; minpos = pos[(H+l)/f]; } l += f; } while(l < r){ int f = r&-r; int v = st[(H+r)/f-1]; if(v < minval){ minval = v; minpos = pos[(H+r)/f-1]; } r -= f; } return minval; } public int min(int l, int r){ minpos = -1; minval = Integer.MAX_VALUE; min(l, r, 0, H, 1); return minval; } private void min(int l, int r, int cl, int cr, int cur) { if(l <= cl && cr <= r){ if(st[cur] < minval){ minval = st[cur]; minpos = pos[cur]; } }else{ int mid = cl+cr>>>1; if(cl < r && l < mid)min(l, r, cl, mid, 2*cur); if(mid < r && l < cr)min(l, r, mid, cr, 2*cur+1); } } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }