#include <iostream>
#include <vector>
using namespace std;


struct Good {
    int v;
    int w;
};


int zeroOnePack(int n, int m, const vector<Good>& goods) {
    vector<int> dp(m + 1, 0);
    for (const auto& good : goods) {
        for (int j = m; j >= good.v; j--) {
            dp[j] = max(dp[j], dp[j - good.v] + good.w);
        }
    }

    return dp[m];
}

int main()
{
    int t = 1, n, m, wi, vi, s;
    cin >> n >> m;
    vector<Good> goods;
    while(n--) {
        cin >> vi >> wi >> s;
        int k;
        // Break multiple knapsack into 0-1 knapsack using binary split
        auto binarySplitToZeroOne = [&]() {
         for (k = 1; k <= s; k <<= 1) {
                 goods.push_back({k * vi, k * wi});
                 s -= k;
            }
            if (s > 0) {
                goods.push_back({s * vi, s * wi});
            }
        };
        if (s > 0) { // Multiple knapsack
            binarySplitToZeroOne();  
        } else if (s == 0) { // Complete knapsack
            s = m / vi; // convert to multiple knapsack
            binarySplitToZeroOne();
        } else if (s == -1) { // zero one knapsack
            goods.push_back({vi, wi});
        }
    }

    auto res = zeroOnePack(n, m, goods);
    cout << res <<endl;

    return 0;
}