#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************



vector<int> a;


int bruteforce(int n, int k1, int k2){
	int ans = 0;
	
	for(int i=0; i<n-2; i++){
		for(int j=i+1; j<n-2; j++){
			int leftSum = a[i] + a[j];
			if(leftSum <= k1) continue;
			
			for(int k=j+1; k<n-1; k++){
				for(int l=k+1; l<n; l++){
					int rightSum = a[k] + a[l];
					if(rightSum > k2 ) ans++;
				}
			}
		}
	}
	return ans;
}





int consistency1(int n, int k1, int k2) {
	
	int ans = 0;
	
	vector<int> pairsFrom(n);
	int s = 0, e = n-1;
	while(s<e){
		if(a[s] + a[e] > k2){
			e--;
		}
		else{
			pairsFrom[s] = n-e-1;
			s++;
		}
	}
	while(s<n){
		pairsFrom[s] = n-s-1;
		s++;
	}
	
	vector<int> sPairs(n+1);
	for(int i=n-1; i>=0; i--){
		sPairs[i] = sPairs[i+1] + pairsFrom[i];
	}
	
	
	s = 0, e = n-3;
	while(s<e){
		if(a[s] + a[e] <= k1){
			s++;
		}
		else{
			int left = e-s;
			int right = sPairs[e+1];
			
			ans += (left * right);
			
			e--;
		}
	}
	
	return ans;
	
}








int consistency2(int n, int k1, int k2) {
	
	int ans = 0;
	
	
	vector<int> pairsEndingAt(n);
	int s = 0, e = n-1;
	while(s<e){
		if(a[s] + a[e] <= k1){
			s++;
		}
		else{
			pairsEndingAt[e] = e-s;
			e--;
		}
	}
	
	

	vector<int> pairsFrom(n);
	s = 0, e = n-1;
	while(s<e){
		if(a[s] + a[e] > k2){
			e--;
		}
		else{
			pairsFrom[s] = n-e-1;
			s++;
		}
	}
	while(s<n){
		pairsFrom[s] = n-s-1;
		s++;
	}
	
	vector<int> sPairs(n+1);
	for(int i=n-1; i>=0; i--){
		sPairs[i] = sPairs[i+1] + pairsFrom[i];
	}
	
	

	for(int j=1; j<n-2; j++){

		int left= pairsEndingAt[j];
		
		int right = sPairs[j+1];
		
		ans += left*right;
	}

	return ans;
}



















int practice(int n, int k1, int k2) {
	
	return 0;
	
}






void solve() {
    
	int n, k1, k2;
	cin >> n >> k1 >> k2;
	
	a.resize(n);
	for(int i=0; i<n; i++) cin >> a[i];
    
    cout << bruteforce(n, k1, k2) << " -> ";
    cout << consistency1(n, k1, k2) << " ";
    cout << consistency2(n, k1, k2) << endl;
    
    
    // cout << bruteforce(n, k1, k2) << " -> ";
    // cout << practice(n, k1, k2) << endl;
    
}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}