#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

const int maxn = 1e5 + 5;

ll a[maxn];
pll p[maxn];

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n;
        ll l, r;
        scanf("%d%I64d%I64d", &n, &l, &r);
        int cnt = 0;
        for(int i = 1; i <= n; ++i) scanf("%I64d", a + i);
        sort(a + 1, a + n + 1);
        for(int i = 1; i < n; ++i)
        {
            ll upp = min(r + 1, a[i] + a[i + 1]), down = max(a[i + 1] - a[i], l - 1);
            if(upp - down > 1) p[cnt++] = pll(down + 1, upp - 1);
        }
        ll ans = 0;
        sort(p, p + cnt);
        for(int i = 0, j = 0; i < cnt; i = j)
        {
            ll rg = p[i].second;
            while(j < cnt && rg >= p[j].first)
            {
                rg = max(rg, p[j].second);
                ++j;
            }
            ans += rg - p[i].first + 1;
        }
        ans = r - l + 1 - ans;
        printf("%I64d\n", ans);
    }
    return 0;
}