#define  _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <list>
#include <string>
#include <cmath>
#include <bitset>
const int MAXN = 1e5+ 8;
int main() {
	int n, m; 
	cin >> n >> m;
	int f[MAXN], v[MAXN];
	int w[MAXN];
	int cnt = 0;
	memset(f, 0, sizeof(f));

	for (int i = 0; i < n; i++) {
		
		int a, b, c;
		cin >> a >> b >> c;
		int k = 1;
		while (k <= c) {
			cnt++;
			v[cnt] = a * k;
			w[cnt] = b * k;
			c -= k;
			k *= 2;
		}
		if (c > 0) {
			cnt++;
			v[cnt] = a * c;
			w[cnt] = b * c;
		}
	}

	for (int i = 1; i <= cnt; i++)
		for (int j = m;j>=v[i]; --j) 
			f[j] = max(f[j], f[j -w[i]] +v[i] );
		
	cout << f[m] << endl;
	return 0;
}