Given an array of positive integers and two positive integers K1 and K2. Find sum of all elements greater tha K_{1}^{th} and smaller than K_{2}^{th} smallest elements of array.

Input: The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N, denoting the length of the array. Next line contains N space seperated integers of the array. Third line contains two space seperated integers denoting K_{1}^{th} and K_{2}^{th} smallest elements.

Output: For each test case, output the sum of all the elements between K_{1}^{th} and K_{2}^{th} smallest elements.

Constraints: 1 <= T <= 100
1 <= N <= 10^{7} 1 <= K_{1}, K_{2} <= 10^{14}