#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef pair<pair<int,int>,int> ppiii;

int main(){
	int N,B,R=0;
	scanf("%d%d",&N,&B);
	vector<ppiii> v(N);
	for(int i=0;i<N;i++)scanf("%d%d%d",&v[i].first.first,&v[i].first.second,&v[i].second);
	sort(v.begin(),v.end());
	for(int i=0;i<N;i++)for(int j=i;j<N;j++){
		vector<pair<int,int> > z;
		for(int k=i;k<=j;k++)z.push_back(make_pair(v[k].first.second,v[k].second));
		sort(z.begin(),z.end());
		int start=0,end=0,point=0;
		for(;end<z.size()&&point<=B;)point+=z[end++].second;
		R=max(end-start,R);
		for(;end<z.size();){
			for(;start<z.size()&&point>B;)point-=z[start++].second;
			for(;end<z.size()&&point<=B;)point+=z[end++].second;
			R=max(end-start,R);
		}
	}
	printf("%d\n",R);
}
/*
3 100
0 0 1
1 2 1
2 1 1
=> 3
*/