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

int N, B;
int X[500], Y[500], P[500];
int id[500];
int Xs[500], Ps[500], Cs[500];

bool comp(int i, int j){
	return (X[i] < X[j]);
}

int main(){
	cin >> N >> B;
	for(int i=0;i<N;i++){
		cin >> X[i] >> Y[i] >> P[i];
		id[i] = i;
	}

	sort(id, id + N, comp);

	int res = 0;
	for(int i=0;i<N;i++)for(int j=i;j<N;j++){
		int up = Y[i], bot = Y[j];
		if(up < bot)swap(up, bot);

		int sz = 0;
		for(int k=0;k<N;k++){
			int t = id[k];
			if(Y[t] < bot || up < Y[t])continue;

			if(sz == 0 || Xs[sz-1] != X[t]){
				Xs[sz] = X[t];
				Ps[sz] = P[t];
				Cs[sz] = 1;
				++sz;
			} else {
				Ps[sz-1] += P[t];
				Cs[sz-1] += 1;
			}
		}

		int psum = 0, csum = 0, p = 0;
		for(int i=0;i<sz;i++){
			psum += Ps[i];
			csum += Cs[i];

			while(p <= i && psum > B){
				psum -= Ps[p];
				csum -= Cs[p];
				++p;
			}

			res = max(res, csum);
		}
	}

	cout << res << endl;
	return 0;
}