Chef recently solved his first problem on CodeChef. The problem he solved has N test cases. He gets a score for his submission according to the following rules:

1) If Chef’s code passes all the N test cases, he gets 100 points.

2) If Chef’s code does not pass all the test cases, but passes all the first M\;(M < N) test cases, he gets K\;(K < 100) points.

3) If the conditions 1 and 2 are not satisfied, Chef does not get any points (i.e his score remains at 0 points).

You are given $a binary array A_{1}, A_{2}, \dots, A_{N}$ of length N, where A_{i} = 1 denotes Chef's code passed the i^{th} test case, A_{i} = 0 denotes otherwise. You are also given the two integers M, K. Can you find how many points does Chef get?

------ Input Format ------

• First line will contain T, number of testcases. Then the testcases follow.
• The first line of each test case contains three space-separated integers N, M, K.
• The second line contains $N space-separated integer A_{1}, A_{2},\dots, A_{N}$.

------ Output Format ------

For each testcase, output in a single line the score of Chef.

------ Constraints ------

$1 ≤ T ≤ 100$
$2 ≤ N ≤ 100$
$1 ≤ M < N$
$1 ≤ K < 100$
$0 ≤ A_{i} ≤ 1$

----- Sample Input 1 ------
4
4 2 50
1 0 1 1
3 2 50
1 1 0
4 2 50
1 1 1 1
5 3 30
1 1 0 1 1

----- Sample Output 1 ------
0
50
100
0

----- explanation 1 ------
Test case $1$: Chef's code neither passes all $4$ test cases nor passes the first $2$ test cases. Hence he does not get any points.

Test case $2$: Chef's code does not pass all $3$ test cases, but passes the first $2$ test cases. Hence he gets $50$ points.

Test case $3$: Chef's code passes all the $4$ test cases. Hence he gets $100$ points.

见题面

见题面