Teresa picked up enough strawberries, now she wants to pick blueberries from the magical blueberry bush from Rainbowland.

Knowing her previous experience with the strawberries, Teresa wants to pick up the blueberries in a way that she may not exceed the limit proposed.

When picking the blueberries, she noticed that if she pick from the bush i, she couldn't pick the blueberries at the bush i+1 (some sort of magic in rainbowland).

Worried about this, Teresa wants to know the maximum blueberries she can pick, given the number of bushes and the number of blueberries in each bush.

Input

Will contain an integer T, then, T cases will follow, each case starts with a number N and K, being N the number of bushes and K the number of blueberries Teresa will pick as maximum, the next line contains N integers, each one representing the blueberries there is on the i-th bush.

Output

You will output for each test case the string: “Scenario #i: “ where i is the test case you are analyzing, then, an integer denoting the maximum number of blueberries you can grab.

Example

Input:
2
5 100
50 10 20 30 40
5 87
21 45 30 12 14
Output:
Scenario #1: 90
Scenario #2: 65

Output explanation (first scenario)

Teresa picks the 1^st blueberry bush (50), she cannot pick the 2^nd, she decides not to pick until the 5^th one where she picks the “40” blueberry, she could pick the 3^rd bush, but she would exceed the limit (100).

Output explanation (second scenario)

Teresa picks the 1^st, the 3^rd and the 5^th bush, total of (21+30+14 = 65) blueberries

CONSTRAINTS

1 <= N <= 1000
1 <= K <= 1000