#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod=998244353;
ll count(vector<int> a,int x){
int l=0;
int r=a.size()-1;
ll ans = 0;
while(l<r){
if(a[r]+a[l]<=x){
ans+=r-l;
l++;
}
else r--;
}
return ans;
}
void solve() {
int n,l,r;
cin >> n >> l >> r;
vector<int> a(n);
for(int i=0;i<n;i++) cin >> a[i];
sort(a.begin(),a.end());
ll ans = count(a,r)-count(a,l-1);
cout << ans << '\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTW9kPTk5ODI0NDM1MzsKCiAgIGxsIGNvdW50KHZlY3RvcjxpbnQ+IGEsaW50IHgpewogICAgaW50IGw9MDsKICAgIGludCByPWEuc2l6ZSgpLTE7CiAgICBsbCBhbnMgPSAwOwogICAgd2hpbGUobDxyKXsKICAgICAgICBpZihhW3JdK2FbbF08PXgpewogICAgICAgICAgICBhbnMrPXItbDsKICAgICAgICAgICAgbCsrOwogICAgICAgIH0KICAgICAgICBlbHNlIHItLTsKICAgIH0KICAgIHJldHVybiBhbnM7CiAgIH0gCgp2b2lkIHNvbHZlKCkgewoKICAgIGludCBuLGwscjsKICAgIGNpbiA+PiBuID4+IGwgPj4gcjsKICAgIHZlY3RvcjxpbnQ+IGEobik7CgogICAgZm9yKGludCBpPTA7aTxuO2krKykgY2luID4+IGFbaV07CiAgICBzb3J0KGEuYmVnaW4oKSxhLmVuZCgpKTsKCiAgICBsbCBhbnMgPSBjb3VudChhLHIpLWNvdW50KGEsbC0xKTsKICAgIGNvdXQgPDwgYW5zIDw8ICdcbic7Cn0KCmludCBtYWluKCl7IAogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShudWxscHRyKTsKCQogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHNvbHZlKCk7CiAgICAKCiAgICByZXR1cm4gMDsKfQo=