Codeforces Round 925 (Div. 3) |
---|
Finished |
Polycarp has two favorite integers x and y (they can be equal), and he has found an array a of length n.
Polycarp considers a pair of indices ⟨i,j⟩ (1≤i<j≤n) beautiful if:
For example, if x=5, y=2, n=6, a=[1,2,7,4,9,6], then the only beautiful pairs are:
The first line of the input contains a single integer t (1≤t≤104) — the number of test cases. Then the descriptions of the test cases follow.
The first line of each test case contains three integers n, x, and y (2≤n≤2⋅105, 1≤x,y≤109) — the size of the array and Polycarp's favorite integers.
The second line of each test case contains n integers a1,a2,…,an (1≤ai≤109) — the elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.
For each test case, output a single integer — the number of beautiful pairs in the array a.
76 5 21 2 7 4 9 67 9 51 10 15 3 8 12 159 4 1014 10 2 2 11 11 13 5 69 5 610 7 6 7 9 7 7 10 109 6 24 9 7 1 2 2 13 3 159 2 314 6 1 15 12 15 8 2 1510 5 713 3 3 2 12 11 3 7 13 14
2 0 1 3 5 7 0
Name |
---|