#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const int big=1e9+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
/*

*/
const int maxsei=100001;
int main(void){
	int i,n,m,A,B,ans=big;cin>>n>>m;
	//想定解確認用の愚直
	if(n>1000){return 0;}
	vector<int>x(n);
	vector<int>a(n);
	vector<int>b(n);
	for(i=0;i<n;i++){cin>>x[i]>>a[i]>>b[i];}
	for(A=0;A<=100;A++){
		for(B=0;B<=100;B++){
			int ni=0,san=0;
			for(i=0;i<n;i++){
				int X=x[i];
				if(a[i]>=A){X++;}
				if(b[i]>=B){X++;}
				if(X>=2){ni++;}
				if(X>=3){san++;}
			}
			if(m<=ni&&ans>san){ans=san;}
		}
	}
	cout<<ans<<endl;
	return 0;
}