#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<list>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
#define MK make_pair
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll n,W;
    cin>>n>>W;
    vector<ll> dp(W+1,0);
    for(int i=0;i<n;i++){
        ll v,w,m;
        cin>>v>>w>>m;
        for(int t=0;m>0;t++){
            ll k=min(m,(ll)1<<t);
            m-=k;
            ll vd=v*k;
            ll wd=w*k;
            for(ll h=W-wd;h>=0;h--){
                dp[h+wd]=max(dp[h+wd],dp[h]+vd);
            }
        }
    }
    ll mx=0;
    for(int i=0;i<=W;i++){
        mx=max(mx,dp[i]);
    }
    cout<<mx<<endl;
    
    return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

You have N items that you want to put them into a knapsack. Item i has value vi, weight wi and limitation mi.

You want to find a subset of items to put such that:

* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.
* You can select at most mi items for ith item.



Find the maximum total value of items in the knapsack.

Constraints

* 1 ≤ N ≤ 100
* 1 ≤ vi ≤ 1,000
* 1 ≤ wi ≤ 1,000
* 1 ≤ mi ≤ 10,000
* 1 ≤ W ≤ 10,000

Input


N W
v1 w1 m1
v2 w2 m2
:
vN wN mN


The first line consists of the integers N and W. In the following N lines, the value, weight and limitation of the i-th item are given.

Output

Print the maximum total values of the items in a line.

Examples

Input

4 8
4 3 2
2 1 1
1 2 4
3 2 2


Output

12


Input

2 100
1 1 100
2 1 50


Output

150

### Response

```cpp
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<list>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
#define MK make_pair
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll n,W;
    cin>>n>>W;
    vector<ll> dp(W+1,0);
    for(int i=0;i<n;i++){
        ll v,w,m;
        cin>>v>>w>>m;
        for(int t=0;m>0;t++){
            ll k=min(m,(ll)1<<t);
            m-=k;
            ll vd=v*k;
            ll wd=w*k;
            for(ll h=W-wd;h>=0;h--){
                dp[h+wd]=max(dp[h+wd],dp[h]+vd);
            }
        }
    }
    ll mx=0;
    for(int i=0;i<=W;i++){
        mx=max(mx,dp[i]);
    }
    cout<<mx<<endl;
    
    return 0;
}

```