import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

void main() {
    int n, w;
    scan(n, w);

    auto dp = new int[](w + 1);

    foreach (i ; 1 .. n + 1) {
        int val, wei, m;
        scan(val, wei, m);

        for (int k; m > 0; k++) {
            int take = min(m, 1<<k);
            m -= take;

            foreach_reverse (j ; take * wei .. w + 1) {
                dp[j] = max(dp[j], dp[j - take * wei] + val * take);
            }
        }
    }

    writeln(dp[w]);
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}