1538C.cpp

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t; cin >> t;
    while (t--) {
        int n, l, r;
        cin >> n >> l >> r;

        vector<int> arr(n);
        for (int i = 0; i < n; i++) {
            cin >> arr[i];
        }

        sort(arr.begin(), arr.end());
        ll count = 0;

        for (int i = 0; i < n; ++i) {
            int low = l - arr[i];
            int high = r - arr[i];

            int left = lower_bound(arr.begin() + i + 1, arr.end(), low) - arr.begin();
            int right = upper_bound(arr.begin() + i + 1, arr.end(), high) - arr.begin();

            count += (right - left);
        }

        cout << count << '\n';
    }

    return 0;
}