import java.util.Scanner;
public class multiKnap {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();//物品数量
int C = sc.nextInt();//背包重量
//为了操作方便,从1开始存储
int[] wei = new int[n+1];
int[] val = new int[n+1];
int[] cnt = new int[n+1];
for (int i = 1; i <= n; i++) {
wei[i] = sc.nextInt();
val[i] = sc.nextInt();
cnt[i] = sc.nextInt();
}
int maxVal = multiKnap(wei, val, cnt, n, C);
System.out.print(maxVal);
}
/*
多重背包问题,转化为0-1背包问题,即将k个相同的分类作为k个不同的分类
*/
public static int multiKnap(int[] wei, int[] val, int[] cnt, int n, int C){
int[] V = new int[C+1];
//假设为ik个不同的物品
int ik = 0;
for (int i = 1; i <=n; i++) {
ik += cnt[i];
}
//标记进行到哪个物品了
int cur = 1;
int sumCnt = 0;//求当前物品的前n个和
for (int i = 1; i <=ik; i++) {
if (i > sumCnt + cnt[cur]) {
sumCnt += cnt[cur];
cur++;
}
//背包公式
for (int j = C; j >= 1; j--) {
if (j >= wei[cur]) {//反向处理
V[j] = Math.max(V[j], V[j - wei[cur]] + val[cur]);
}
else {
break;
}
}
}
return V[C];
}
}