package fenshujs;
import java.util.Arrays;
import java.util.Scanner;
/*
*背包九讲之一:多重背包问题
*/
public class bishi {
//滚动数组实现,也就是最简单的那种
public static void backbag(int n,int v,int[] c,int[] w,int[] num)
{
int[] a = new int[v+1];
for(int i = 0;i<n;i++)
{
for(int j = v;j>0;j--)
{
for(int k = 1;k<=num[i];k++)
{
if(j-k*c[i]>=0&&a[j]<a[ j-k*c[i] ] + k*w[i])
{
a[j] = a[j-k*c[i]] + k*w[i];
}
}
}
}
System.out.println(a[v]);/**/
/* int[][] a = new int[n][v+1];
for(int i = 0;i<n;i++)
for(int j = 0;j<v+1;j++)
{
if(0 == i)
{
a[i][j] = w[i];
}
else if(j>=c[i]&&a[i-1][j]<a[i-1][j-c[i]]+w[i])
{
a[i][j] = a[i-1][j-c[i]]+w[i];
}
else
{
a[i][j] = a[i-1][j];
}
}
System.out.println(a[n-1][v]);*/
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int v = sc.nextInt();
int[] c = new int[n];//每一个物品占用体积
int[] w = new int[n];//每一个物品的价值
int[] num = new int[n];//每一种物品的数量
for(int i = 0;i<n;i++)
{
//依次输入一个物品的体积价值
c[i] = sc.nextInt();
w[i] = sc.nextInt();
num[i] = sc.nextInt();
}
backbag(n,v,c,w,num);/**/
}
}
import java.util.Arrays;
import java.util.Scanner;
/*
*背包九讲之一:多重背包问题
*/
public class bishi {
//滚动数组实现,也就是最简单的那种
public static void backbag(int n,int v,int[] c,int[] w,int[] num)
{
int[] a = new int[v+1];
for(int i = 0;i<n;i++)
{
for(int j = v;j>0;j--)
{
for(int k = 1;k<=num[i];k++)
{
if(j-k*c[i]>=0&&a[j]<a[ j-k*c[i] ] + k*w[i])
{
a[j] = a[j-k*c[i]] + k*w[i];
}
}
}
}
System.out.println(a[v]);/**/
/* int[][] a = new int[n][v+1];
for(int i = 0;i<n;i++)
for(int j = 0;j<v+1;j++)
{
if(0 == i)
{
a[i][j] = w[i];
}
else if(j>=c[i]&&a[i-1][j]<a[i-1][j-c[i]]+w[i])
{
a[i][j] = a[i-1][j-c[i]]+w[i];
}
else
{
a[i][j] = a[i-1][j];
}
}
System.out.println(a[n-1][v]);*/
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int v = sc.nextInt();
int[] c = new int[n];//每一个物品占用体积
int[] w = new int[n];//每一个物品的价值
int[] num = new int[n];//每一种物品的数量
for(int i = 0;i<n;i++)
{
//依次输入一个物品的体积价值
c[i] = sc.nextInt();
w[i] = sc.nextInt();
num[i] = sc.nextInt();
}
backbag(n,v,c,w,num);/**/
}
}