#include <algorithm>
using namespace std;

int main() {
    int N, V;
    cin >> N >> V;
    int dp[105] = {0};

    for (int i = 0; i < N; i++) {
        int v, w, s;
        cin >> v >> w >> s;
        for (int j = V; j >= 0; j--) {
            for (int k = 1; k <= s && k * v <= j; k++) {
                dp[j] = max(dp[j], dp[j - k * v] + k * w);
            }
        }
    }

    cout << dp[V] << endl;
    return 0;
}