#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = int(l);i < int(r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

int N,M;
const int MAX_N = 100000;
vector<int> X;
int cnt [10];
vector<int> A [MAX_N + 1],B [MAX_N + 1];

int main()
{
	scanf("%d%d",&N,&M);
	X.assign(N,0);
	FOR(i,0,N){
		int a,b;
		scanf("%d%d%d",&X [i],&a,&b);
		A [a].push_back(i);
		B [b].push_back(i);
		X [i]++;
		cnt [X [i]]++;
	}

	int ans = MAX_N,p = MAX_N;
	for(int i = -1;i <= MAX_N;i++){
		if(i >= 0){
			FOR(j,0,A [i].size()){
				cnt [X [A [i] [j]]]--;
				X [A [i] [j]]--;
				cnt [X [A [i] [j]]]++;
			}
		}
		while(p >= 0 && accumulate(cnt + 2,cnt + 6,0) < M){
			FOR(j,0,B [p].size()){
				cnt [X [B [p] [j]]]--;
				X [B [p] [j]]++;
				cnt [X [B [p] [j]]]++;
			}
			p--;
		}
		if(accumulate(cnt + 2,cnt + 6,0) >= M){
			chmin(ans,accumulate(cnt + 3,cnt + 6,0));
		}
	}
	printf("%d\n",ans);

	return 0;
}