#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
const int maxn=100010;
ll a[maxn];
struct Interval{
    ll l,r;
    bool operator<(const Interval& rhs)const{
        return l<rhs.l||(l==rhs.l&&r<rhs.r);
    }
}b[maxn];
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        ll L,R;
        cin>>n>>L>>R;
        for(int i=0;i<n;i++){
            scanf("%I64d",&a[i]);
        }
        sort(a,a+n);
        for(int i=0;i<n-1;i++){
            b[i].l=a[i+1]-a[i]+1;
            b[i].r=a[i+1]+a[i]-1;
        }
        sort(b,b+n-1);
//        for(int i=0;i<n-1;i++){
//            cout<<b[i].l<<" "<<b[i].r<<endl;
//        }
        ll LL=b[0].l,RR=b[0].r,ans=0;
        for(int i=1;i<n-1;i++){
            if(b[i].l<=RR){
                RR=b[i].r>RR?b[i].r:RR;
            }else{
                if(LL>=L&&RR<=R){
                    ans+=RR-LL+1;
                }else if(LL<L&&RR>=L&&RR<=R){
                    ans+=RR-L+1;
                }else if(LL>=L&&LL<=R&&RR>R){
                    ans+=R-LL+1;
                }
                LL=b[i].l;
                RR=b[i].r;
            }
            //cout<<"$ "<<LL<<" "<<RR<<endl;
        }
        if(LL>=L&&RR<=R){
            ans+=RR-LL+1;
        }else if(LL<L&&RR>=L&&RR<=R){
            ans+=RR-L+1;
        }else if(LL>=L&&LL<=R&&RR>R){
            ans+=R-LL+1;
        }
        cout<<(R-L+1-ans)<<endl;
    }
    return 0;
}

/*
1 
5 3 20
1 3 6 7 9
*/