#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N,B;
vector<pair<pair<int,int>,int> >XY;
main()
{
	cin>>N>>B;
	for(int i=0;i<N;i++)
	{
		int x,y,p;cin>>x>>y>>p;
		XY.push_back(make_pair(make_pair(x,y),p));
	}
	sort(XY.begin(),XY.end());
	int ans=0;
	for(int i=0;i<N;i++)
	{
		if(i!=0&&XY[i-1].first.first==XY[i].first.first)continue;
		for(int j=i;j<N;j++)
		{
			if(j+1<N&&XY[j].first.first==XY[j+1].first.first)continue;
			vector<pair<int,int> >y;
			for(int k=i;k<=j;k++)y.push_back(make_pair(XY[k].first.second,XY[k].second));
			sort(y.begin(),y.end());
			int l=0,nowb=0;
			for(int r=0;r<y.size();)
			{
				while(r+1<y.size()&&y[r].first==y[r+1].first)
				{
					nowb+=y[r].second;
					r++;
				}
				nowb+=y[r].second;
				r++;
				while(l<=r&&nowb>B)
				{
					while(l+1<y.size()&&y[l].first==y[l+1].first)
					{
						nowb-=y[l].second;
						l++;
					}
					nowb-=y[l].second;
					l++;
				}
				ans=max(ans,r-l);
			}
		}
	}
	cout<<ans<<endl;
}