A new grand chicken stall is about to open in Chennai. Buddy and Pre being close friends joined hands and planned to go for it. People have to serve themselves here in this stall.

There are N-counters available and each counter has a specified number of chicken nuggets.

The cost of each nugget being bought at any counter is same as the number of nuggets that are still remaining at the counter at that point of time (inclusive of the nugget being bought).

Pre wants to have M nuggets. As usual Buddy accepts to sponsor Pre with all his pocket money. He is so innocent that he obeys each and every order of Pre with no second thought. Pre being cunning wants Buddy to spend her too much money. So she directs buddy to buy nuggets at the counters which she says, so that he spends maximum money for her.

Of course you can't help Buddy :( But try to find him how much he would spend for Pre, if he obeys her like an IDIOT.

Input

The first line of the input contains the number of test cases, T. T test cases follow:

The first line of each test case contains an integer N, denoting the number of counters.

The next line consists of N integers: A1, A2, ... An denoting the number of nuggets available at each counter.

The next line consists of a single integer M, number of nuggets Pre wishes to have.

Output

For each test case output a single integer in a single line denoting the money that buddy would spend.

Constraints

1 <= T <= 10

1 <= N <= 100000

1 <= A1, A2 ... An <= 100000

1 <= M <= A1 + A2 + A3 + ... + An

Example

Input:
1
3
3 5 4
3

Output:
13

Explanation

Pre would ask buddy to get two nuggets from the second counter (5 + 4 = 9), and then one from the third counter (9 + 4 = 13)