#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)




int N, W;
int v[101], w[101], m[101];
int dp[2010][10101];
//-----------------------------------------------------------------------------------
int main() {
    cin >> N >> W;
    rep(i, 0, N) cin >> v[i] >> w[i] >> m[i];

    vector<pair<int, int>> items;
    rep(i, 0, N) {
        for (int j = 1; j <= m[i]; j *= 2) {
            int sm = j - 1;
            int mm = min(m[i] - sm, j);
            items.push_back({ v[i] * mm, w[i] * mm });
            if (m[i] - sm < j) break;
        }
    }

    int n = items.size();
    rep(i, 0, n) rep(j, 0, W + 1) {
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        if (j + items[i].second <= W)
            dp[i + 1][j + items[i].second] = max(dp[i + 1][j + items[i].second], dp[i][j] + items[i].first);
    }

    int ans = 0;
    rep(j, 0, W + 1) ans = max(ans, dp[n][j]);
    cout << ans << endl;
}