#include <cstdio>
#include <algorithm>
using namespace std;
const int M = 40000 + 10;
int n, m, v, w, p;
unsigned long long int f[M];
int main() {
    freopen("treasure.in", "r", stdin);
    freopen("treasure.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; i++) {
        scanf("%d %d %d", &v, &w, &p);
        for(int k=1; k<=p; p-=k, k*=2)
            for(int j=m; j>=w*k; j--)
                f[j] = max(f[j], f[j - w*k] + v*k);
        if(p > 0)
            for(int j=m; j>=w*p; j--)
                f[j] = max(f[j], f[j - w*p] + v*p);
    }
    printf("%lld\n", f[m]);
    return 0;
}