#include <iostream>
#include <vector>
#include <algorithm>

using namespace std; struct Item {

int v, w;

}; int main() {

int n, W;
cin >> n >> W;
vector<Item> items;
for (int i = 0; i < n; ++i) {
    int v, w, m;
    cin >> v >> w >> m;
    for (int k = 1; k <= m; k *= 2) {
        items.push_back({k * v, k * w});
        m -= k;
    }
    if (m > 0) {
        items.push_back({m * v, m * w});
    }
}
vector<int> dp(W + 1, 0);
for (const auto& item : items) {
    for (int j = W; j >= item.w; --j) {
        dp[j] = max(dp[j], dp[j - item.w] + item.v);
    }
}
cout << dp[W] << endl;
return 0;

}