#include<cstdio>#include<cstring>#include<cctype>#include<algorithm>using namespace std;#define rep(i,s,t) for(int i=s;i<=t;i++)#define dwn(i,s,t) for(int i=s;i>=t;i--)#define clr(x,c) memset(x,c,sizeof(x))int read(){	int x=0;char c=getchar();	while(!isdigit(c)) c=getchar();	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();	return x;}const int nmax=105;const int maxn=5e4+5;const int inf=0x7f7f7f7f;int tw[nmax],tv[nmax],c[nmax];int w[maxn],v[maxn];int dp[maxn];void maxs(int &a,int b){	if(a<b) a=b;}int main(){	int n=read(),m=read(),cnt=0;	rep(i,1,n) tw[i]=read(),tv[i]=read(),c[i]=read();	rep(i,1,n){		int j,ta=tw[i],tb=tv[i],&tc=c[i];		for(j=0;(1<<j)<tc;j++) w[++cnt]=ta*(1<<j),v[cnt]=tb*(1<<j),tc-=(1<<j);		w[++cnt]=ta*tc;v[cnt]=tb*tc;	}	rep(i,1,cnt) dwn(j,m,w[i]) maxs(dp[j],dp[j-w[i]]+v[i]);	printf("%d\n",dp[m]);	return 0;}