At dawn, Venus sets a second task for Psyche.
She is to cross a river and fetch golden wool from violent sheep who graze on the other side.
The sheep are wild and tameless, so Psyche keeps on throwing sticks to keep them away.
There are $ n $ sticks on the ground, the length of the $ i $-th stick is $ a_i $.
If the new stick she throws forms a triangle with any two sticks on the ground, the sheep will be irritated and attack her.
Psyche wants to throw a new stick whose length is within the interval $ [L, R] $. Help her calculate the number of valid sticks she can throw next time.
The first line of input contains an integer $ T $ $ (1 \le T \le 10) $, which denotes the number of test cases.
For each test case, the first line of input contains single integer $ n, L, R $ $ (2 \le n \le 10 ^ 5, 1 \le L \le R \le 10 ^ {18}) $.
The second line contains $ n $ integers, the $ i $-th integer denotes $ a_i $ $ (1 \le a_i \le 10 ^ {18}) $.
For each test case, print the number of ways to throw a stick.