#include <bits/stdc++.h>
using namespace std;

const int N = 1010, M = 1010;

int f[M];
int n, m;
int w[N], v[N], s[N];

int main()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> s[i];

    for(int i = 1; i <= n; i++)
    {
        //01背包
        if(s[i] == -1)
        {
            for(int j = m; j >= v[i]; j--)
            f[j] = max(f[j],f[j-v[i]]+w[i]);
        }

        //完全背包
        if(s[i] == 0)
        {
            for(int j = v[i]; j <= m; j++)
            f[j] = max(f[j],f[j-v[i]]+w[i]);
        }

        //多重背包(需要使用二进制优化才能过)
        if(s[i] > 0)
        {
            int ww[N], vv[N];
            int k = 1, cnt = 1;

            while(s[i] >= k)
            {
                vv[cnt] = k * v[i];
                ww[cnt] = k * w[i];
                cnt ++;

                s[i] -= k;
                k *= 2;
            }

            if(s[i])
            {
                vv[cnt] = s[i] * v[i];
                ww[cnt] = s[i] * w[i];
                cnt ++;
            }

            for(int i = 1; i < cnt; i++)
            {
                for(int j = m; j >= vv[i]; j--)
                f[j] = max(f[j],f[j-vv[i]]+ww[i]);
            }
        }
    }

    cout << f[m] << endl;

    return 0;
}