#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100010;
int xx[N],a[N],b[N];
int n,m,ans=LLONG_MAX;
bool P(int x,int y,int f)
{
	if(f==1){
		int t=y;y=x;x=t;
	}int cur=0,cnt2;
	for(int i=1;i<=n;++i){
		cur=xx[i];
		cur+=(a[i]>=x);
		cur+=(b[i]>=y);
		cnt2+=(cur>=2);
	}
	return cnt2>=m;
}
int sc(int x,int y,int f){
	if(f==1){
		int t=y;y=x;x=t;
	}int res=0,now=0;
	for(int i=1;i<=n;++i)	{
		now=xx[i];
		now+=(a[i]>=x);
		now+=(b[i]>=y);
		res+=(now>=3);
	}return res;
}signed main(){
	freopen("difficulty.in","r",stdin);
	freopen("difficulty.out","w",stdout);
	cin>>n>>m;
	int mxa=-1,mxb=-1;
	for(int i=1;i<=n;++i){
		cin>>xx[i]>>a[i]>>b[i];
		mxa=max(mxa,a[i]);mxb=max(mxb,b[i]);
	}if(mxb>mxa){
		for(int i=1;i<=mxb+1;++i){
			int l=0,r=mxa+1,res=0;
			while(l<=r){
				int mid=l+(r-l)/2;
				if(P(i,mid,1)){
					res=mid;
					l=mid+1;
				}else r=mid-1;
			}ans=min(ans,sc(i,res,1));
		}cout<<ans;
		return 0;
	}for(int i=1;i<=mxa+1;++i){
		int l=0,r=mxb+1,res=0;
		while(l<=r){
			int mid=l+(r-l)/2;
			if(P(i,mid,0)){
				res=mid;
				l=mid+1;
			}else r=mid-1;
		}ans=min(ans,sc(i,res,0));
	}cout<<ans;
	return 0;
}