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

using namespace std;
const int N = 1010;
int f[N];
int n, m;

struct Thing
{
    int kind;
    int v, w;
};

int main()
{
    cin >> n >> m;
    vector<Thing> things;
    for(int i = 0; i < n; i++)
    {
        int v, w, s;
        cin >> v >> w >> s;
        if(s < 0) things.push_back({-1, v, w});
        else if(s == 0) things.push_back({0, v, w});
        else
        {
            for(int k = 1; k <= s; k *= 2)
            {
                s -= k;
                things.push_back({-1, v * k, w * k});
            }
            if(s > 0) things.push_back({-1, v * s, w * s});
        }
    }

    for(auto thing : things)
    {
        if(thing.kind < 0)
        {
            for(int j = m; j >= thing.v; j--) f[j] = max(f[j], f[j-thing.v] + thing.w);
        }
        else
        {
            for(int j = thing.v; j <= m; j++) f[j] = max(f[j], f[j - thing.v] + thing.w);
        }
    }
    cout << f[m] << endl;
    return 0;
}