/* -*- coding: utf-8 -*-
 *
 * 568.cc: No.568 じゃんじゃん　落とす　委員会 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_A = 100000;
const int MAX_B = 100000;
const int INF = 1 << 30;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

int xs[MAX_N];
pii aps[MAX_N], bps[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < n; i++) {
    int xi, ai, bi;
    scanf("%d%d%d", &xi, &ai, &bi);
    xs[i] = xi;
    aps[i] = pii(ai, i);
    bps[i] = pii(bi, i);
  }

  sort(aps, aps + n);
  sort(bps, bps + n);

  int n2 = 0, n3 = 0;
  for (int i = 0; i < n; i++) {
    xs[i]++;
    if (xs[i] >= 2) {
      n2++;
      if (xs[i] >= 3) n3++;
    }
  }
  //printf("n2=%d, n3=%d\n", n2, n3);

  int sa = 0, sb = MAX_B + 1;
  int minn3 = INF;

  for (int ai = 0, bi = n;;) {
    //printf("ai=%d, bi=%d\n", ai, bi);
    while (bi > 0 && n2 < m) {
      sb--;
      while (bi > 0 && bps[bi - 1].first >= sb) {
	bi--;
	int &k = bps[bi].second;
	xs[k]++;
	if (xs[k] == 3) n3++;
	else if (xs[k] == 2) n2++;
      }
    }

    if (n2 >= m && minn3 > n3) minn3 = n3;
    if (ai >= n) break;

    while (ai < n && aps[ai].first <= sa) {
      int &k = aps[ai].second;
      if (xs[k] == 3) n3--;
      else if (xs[k] == 2) n2--;
      xs[k]--;
      ai++;
    }
    sa++;
  }

  printf("%d\n", minn3);
  return 0;
}