#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <cstring>

#define clr(t)	memset(t,0,sizeof(t))
#define rep(i,n) for(int (i) = 0;i < (n);i++)
using namespace std;

int main()
{
	int n,b;
	cin >> n >> b;

	map<int,int> mx,my;
	int x[500],y[500],p[500];

	rep(i, n){
		cin >> x[i] >> y[i] >> p[i];
		mx[x[i]] = my[y[i]] = 0;
	}
	
	int xcount = 0;
	for (auto && i : mx)
		i.second = xcount++;
	int ycount = 0;
	for (auto && i : my)
		i.second = ycount++;

	vector<pair<int,int>> d[500];

	rep(i, n)
	{
		d[my[y[i]]].push_back(make_pair(mx[x[i]],p[i]));
	}

	int ans = 0;
	rep(x1,xcount)
	for (int x2 = x1; x2 < xcount; x2++)
	{
		int y1=0,y2=0;
		int psum = 0;int sum = 0;
		for (auto i : d[0])
		{
			if (i.first >= x1 && i.first <= x2)
			{
				psum += i.second;
				sum++;
			}
		}

		if (psum <= b)
		ans = max(sum, ans);

		while (!(y1 == ycount-1 && y2 == ycount-1))
		{
			if (psum > b || y2 == ycount-1)
			{
				for (auto i : d[y1])
				{
					if (i.first >= x1 && i.first <= x2)
					{
						psum -= i.second;
						sum--;
					}
				}
				y1++;
			}
			else
			{
				y2++;
				for (auto i : d[y2])
				{
					if (i.first >= x1 && i.first <= x2)
					{
						psum += i.second;
						sum++;
					}
				}
			}
			if (psum <= b)
			ans = max(sum,ans);
		}

	}

	cout << ans << endl;


	return 0;
	
}