Given an array of positive integers and two positive integers K1 and K2. Find sum of all elements greater tha K1th and smaller than K2th 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 K1th and K2th smallest elements.
Output: For each test case, output the sum of all the elements between K1th and K2th smallest elements.
Constraints: 1 <= T <= 100
1 <= N <= 107 1 <= K1, K2 <= 1014