#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2010;
int n,m,dp[N];
struct GOOD{
    int v;
    int w;
};
vector <GOOD> goods;
int main(){

    cin>>n>>m;
    while(n--){
        int v,w,s;
        cin>>v>>w>>s;
        for(int k=1;k<=s;k*=2){
            s-=k;
            goods.push_back({v*k,w*k});
        }
        if(s>0)goods.push_back({v*s,w*s});
    }
    for(auto good:goods){
        for(int j=m;j>=good.v;j--){
            dp[j]=max(dp[j],dp[j-good.v]+good.w);
        }
    }
    cout<<dp[m];
}