#include <bits/stdc++.h>
using namespace std;
const int N = 100010,M = 40010;
int n,m1,t;
struct made{
    int v,w;
}a[N],c[N];
int m[N],s[M];
int main(){
    freopen("treasure.in","r",stdin);
    freopen("treasure.out","w",stdout);
    scanf("%d%d",&n,&m1);
    for(int i = 1;i <= n;i++){
        scanf("%d%d%d",&a[i].v,&a[i].w,&m[i]);
    }
    for(int i = 1;i <= n;i++){
        int S = m[i],p = 1;
        while(p <= S){
            t++;
            c[t].v = p * a[i].v;
            c[t].w = p * a[i].w;
            S -= p,p <<= 1;
        } 
        if(S > 0){
            t++;
            c[t].v = S * a[i].v;
            c[t].w = S * a[i].w; 
        }
    } 
    for(int i = 1;i <= t;i++){
        for(int j = m1;j >= 1;j--){
            if(j >= c[i].w)s[j] = max(s[j],s[j-c[i].w]+c[i].v);
        }
    }
    printf("%d\n",s[m1]);
    
    return 0;
}