Knapsack Problem with Limitations

You have N items that you want to put them into a knapsack. Item i has value v_i, weight w_i and limitation m_i.

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 m_i 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 ≤ v_i ≤ 1,000
• 1 ≤ w_i ≤ 1,000
• 1 ≤ m_i ≤ 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

---