Problem:
Knapsack Problem with Limitations

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.

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.

Constraints

1 ≤ N ≤ 100

1 ≤ vi ≤ 1,000

1 ≤ wi ≤ 1,000

1 ≤ mi ≤ 10,000

1 ≤ W ≤ 10,000

Sample Input 1

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

Sample Output 1

12

Sample Input 2

2 100
1 1 100
2 1 50

Sample Output 2

150

Solution in C++14 (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
    int N, W;
    std::cin >> N >> W;
    std::vector<int> v, w;
    for (int i = 0; i < N; i++) {
        int v_, w_, m_;
        std::cin >> v_ >> w_ >> m_;
        for (int k = 1; m_ > 0; k *= 2) {
            const int use = std::min(k, m_);
            m_ -= use;
            v.push_back(v_ * use), w.push_back(w_ * use);
        }
    }
    std::vector<int> dp(W + 1, 0);
    for (int i = 0; i < v.size(); i++) {
        for (int j = W - w[i]; j >= 0; j--) { dp[j + w[i]] = std::max(dp[j + w[i]], dp[j] + v[i]); }
    }
    std::cout << *max_element(dp.begin(), dp.end()) << std::endl;
}