#include <cstdio>

using namespace std;

#define N 5050

int c[N], d[N], x[N], book[N], n, ans = 0, maxans = 0;

int max(int a, int b)
{
	if(a > b)
	{
		return a;
	}
	return b;
}
void dfs(int b, int must)
{
	if(must != 0)
	{
		if(b >= c[must] - d[must]&&book[must])
		{
			ans++;
			book[must] = 0;
			dfs(b - c[must] + d[must], x[must]);
			ans--;
			book[must] = 1;
		}
		return;
	}
	for(int i = n; i >= 1; i--)
	{
		if(b >= c[i] - d[i]&&book[i])
		{
			if(b >= c[i])
			{
				ans++;
				book[i] = 0;
				maxans = max(maxans, ans);
				dfs(b - c[i], 0);
				ans--;
				book[i] = 1;
			}
			ans++;
			book[i] = 0;
			maxans = max(maxans, ans);
			dfs(b - c[i] + d[i], x[i]);
			ans--;
			book[i] = 1;
		}
	}
	return;
}
int main()
{	
	int b;
	freopen("market.in", "r", stdin);
	freopen("market.out", "w", stdout);
	
	scanf("%d%d", &n, &b);
	
	scanf("%d %d", &c[1], &d[1]);
	
	x[1] = 0;
	for(int i = 1; i <= n; i++)
	{
		book[i] = 1;
	}
	for(int i = 2; i <= n; i++)
	{
		
		scanf("%d%d%d", &c[i], &d[i], &x[i]);
		
	}
	dfs(b, 0);
	
	printf("%d\n", maxans + 1);
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}