#include <cstdio>
#include <algorithm>
#define LL long long
using namespace std;
const LL Maxn=100010;
const LL Inf=(LL)1<<62;
LL n,Kase,L,R,a[Maxn],Ans,last;
struct Node {LL l,r;}T[Maxn];
inline LL Max(LL x,LL y) {return x>y?x:y;}
inline LL Min(LL x,LL y) {return x>y?y:x;}
inline bool cmp(Node A,Node B) {return A.l<B.l;}
int main()
{
    scanf("%I64d",&Kase);
    for (LL kase=1;kase<=Kase;kase++) 
    {
        scanf("%I64d%I64d%I64d",&n,&L,&R);
        for (LL i=1;i<=n;i++) scanf("%I64d",&a[i]);
        sort(a+1,a+n+1); Ans=0;
        for (int i=1;i<n;i++)
        {
            T[i].l=a[i+1]-a[i]+1;
            T[i].r=a[i+1]+a[i]-1;
        }
        sort(T+1,T+n,cmp);
        last=L-1;
        for (int i=1;i<n;i++)
        {
            if (T[i].l>last) Ans+=Min(R+1,T[i].l)-last-1;
            last=Max(last,T[i].r);
            if (last>=R) break;
        }
        if (R>=last) Ans+=R-last;
        printf("%I64d\n",Ans);
    }
    return 0;
}