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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N, W; cin >> N >> W;
  vector<PII> xs;
  REP(i,N){
	int v, w, m;
	cin >> v >> w >> m;
	int p = 1;
	while(m>=p){
	  m -= p;
	  xs.EB(v*p, w*p);
	  p <<= 1;
	}
	if(m){
	  xs.EB(v*m, w*m);
	}
  }

  LL dp[2][10001];
  fill((LL*)dp, (LL*)dp+2*10001, 0);
  int crt = 0, nxt = 1;
  for(auto&& x: xs){
	REP(w,W+1)
	  dp[nxt][w] = dp[crt][w];
	FOR(w,x.SS,W+1)
	  maxi(dp[nxt][w], dp[crt][w-x.SS] + x.FF);
	swap(crt, nxt);
  }

  cout << *max_element(dp[crt], dp[crt]+W+1) << endl;

  return 0;
}