DP

uses math;
const
	tak_hingga=-1000000000;

var
	n,p,q,z,x:longint;
	B,D,W: array [1..10000] of longint;
	st:string;
function DP(i,j:longint):longint;
begin
	if (i=0) and (0<=j) and (j<=P) then DP:=0
	else if (1<=i) and (i<=n) and (j<0) then DP:=tak_hingga
	else DP:=max( DP(i-1,j), DP(i-1,j-B[i])+ D[i]);
end;


begin
	readln(st);
	readln(N,P,Q);
	for x:=1 to n do readln(B[x],D[x],W[x]);
	z:=DP(n,P);

	if z<0 then writeln(0)
	else writeln(z);
end.