Chemistry Class#12923

Chemistry Class

Walter White has students in his chemistry class. Student has chemistry skill a_i.

He wants to divide students into pairs for a group exercise. The pair works better together if their skills are closer. More precisely,

Walter wants to split students into pairs so that:

Determine if Walter can split students in such a way, and if he can, find the largest possible number of pairs that would produce pure product.

Input

The first line contains a single integer (1 \le t \le 10^5)  — the number of test cases. The description of test cases follows.

The first line of each test case contains three integers n, A, B (1 \leq n \leq 2\cdot 10^5, 1 \leq B < A \leq 10^{18})  — the number of students.

The second line of each test case contains integers a_1, a_2, \ldots, a_{2n} (0 \leq a_i \leq 10^{18})  — skills of the students.

It is guaranteed that the sum of over all test cases does not exceed 2\cdot 10^5.

Output

For each test case, if there is no way to split the students into pairs without blowing up the lab, output . Otherwise, output the largest possible number of pairs that would produce pure product.

Examples

Example

Loading
Loading

Note

In the first test case, it's impossible to split students into pairs without blowing up the lab.

In the second test case, we can pair the first student with the second, and the third one with the fourth one. Both pairs will have a difference in skills equal to , and both will produce pure product.