package contest170908; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { // {i|xi+(ai>=sa)+(bi>=sa) >= 2} >= m // minimize {i|xi+(ai>=sa)+(bi>=sa) >= 3} int n = ni(), m = ni(); int[][] ps = new int[n][]; for(int i = 0;i < n;i++){ ps[i] = new int[]{ni(), ni(), ni(), -1}; } Arrays.sort(ps, new Comparator() { public int compare(int[] a, int[] b) { return -(a[2] - b[2]); } }); for(int i = 0;i < n;i++)ps[i][3] = i; // int[] bs = new int[n]; // for(int i = 0;i < n;i++)bs[i] = ps[i][2]; int[] xs = new int[n]; for(int i = 0;i < n;i++)xs[i] = ps[i][0]; int[] ft1 = new int[n+3]; int[] ft2 = new int[n+3]; int[] ft3 = new int[n+3]; int ge2 = 0; for(int i = 0;i < n;i++){ if(xs[i] == 1){ addFenwick(ft1, i, 1); } if(xs[i] == 2){ addFenwick(ft2, i, 1); } if(xs[i] >= 3){ addFenwick(ft3, i, 1); } if(xs[i] >= 2)ge2++; } Arrays.sort(ps, new Comparator() { public int compare(int[] a, int[] b) { return -(a[1] - b[1]); } }); // tr(ps); int ans = n; for(int i = 0;i < n;){ int j = i; while(j < n && ps[j][1] == ps[i][1])j++; // tr(i, j, ps[i][1], xs, ge2); for(int k = i;k < j;k++){ int id = ps[k][3]; xs[id]++; if(xs[id] == 1){ addFenwick(ft1, id, 1); } if(xs[id] == 2){ addFenwick(ft1, id, -1); addFenwick(ft2, id, 1); ge2++; } if(xs[id] == 3){ addFenwick(ft2, id, -1); addFenwick(ft3, id, 1); } } int need = m-ge2; if(need <= 0){ ans = Math.min(ans, sumFenwick(ft3, n)); // tr(sumFenwick(ft3, n)); }else{ int over = firstGEFenwick(ft1, need); if(over < n){ ans = Math.min(ans, sumFenwick(ft3, n) + sumFenwick(ft2, over)); // tr(sumFenwick(ft3, n) + sumFenwick(ft2, over)); } } i = j; } out.println(ans); } public static int sumFenwick(int[] ft, int i) { int sum = 0; for(i++;i > 0;i -= i&-i)sum += ft[i]; return sum; } public static void addFenwick(int[] ft, int i, int v) { if(v == 0 || i < 0)return; int n = ft.length; for(i++;i < n;i += i&-i)ft[i] += v; } public static int firstGEFenwick(int[] ft, int v) { int i = 0, n = ft.length; for(int b = Integer.highestOneBit(n);b != 0;b >>= 1){ if((i|b) < n && ft[i|b] < v){ i |= b; v -= ft[i]; } } return i; } 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 E().run(); } private byte[] inbuf = new byte[1024]; public 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)); } }