#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const LL mod=1e9+7,I6=(mod+1)/6,I4=(mod+1)/4,I2=(mod+1)/2;
void upd(LL &x,LL y){x=(x+y)%mod;}
LL sqr(LL x){
    x%=mod;
    return x*x%mod;
}
LL S1(LL x){
    x%=mod;
    return x*(x+1)%mod*I2%mod;
}
LL S2(LL x){
    x%=mod;
    return x*(x+1)%mod*(x*2+1)%mod*I6%mod;
}
LL S3(LL x){
    x%=mod;
    return x*x%mod*(x+1)%mod*(x+1)%mod*I4%mod;
}
LL S0(LL l,LL r){
    return (r-l+1)%mod;
}
LL S1(LL l,LL r){
    return (S1(r)-(l==0?0:S1(l-1)))%mod;
}
LL S2(LL l,LL r){
    return (S2(r)-(l==0?0:S2(l-1)))%mod;
}
LL S3(LL l,LL r){
    return (S3(r)-(l==0?0:S3(l-1)))%mod;
}
void solve(){
    LL n,a,b; cin>>n>>a>>b;
    vector s(n,0ll);
    for (LL &x:s) cin>>x;
    LL ans=0;
    for (LL i=0;i<n;++i){
        for (LL j=0;j<n;++j){
            if ((s[i]-s[j])%n!=0) continue;
            LL k=(s[i]-s[j])/n;
            if (b<i||b<j) continue;
            LL r1=(b-i)/n,l1=(a-i+n-1)/n;
            LL r2=(b-j)/n,l2=(a-j+n-1)/n;
            l2-=k; r2-=k;
            LL l=max(l1,l2),r=min(r1,r2);
            if (l>r) continue;
            LL s0=S0(l,r);
            LL s1=S1(l,r);
            LL s2=S2(l,r);
            LL s3=S3(l,r);
            LL A,B,C;
            if (i<=j+k*n) A=s[i],B=(i-a+1)%mod,C=-(b-j-n*k+1)%mod;
            else A=s[i],B=(j+k*n-a+1)%mod,C=-(b-i+1)%mod;
            upd(ans,A*B%mod*C%mod*s0);
            upd(ans,(A*B%mod+B*C%mod+C*A)%mod*n%mod*s1);
            upd(ans,(A+B+C)%mod*n%mod*n%mod*s2);
            upd(ans,n*n%mod*n%mod*s3);
            // for (LL t=l;t<=r;++t){
            //     if (i<=j+k*n) upd(ans,(s[i]+t*n)*(i+t*n-a+1)*(b-j-(t+k)*n+1));
            //     else upd(ans,(s[i]+t*n)*(j+(t+k)*n-a+1)*(b-i-t*n+1));
            //     // cerr<<s[i]+t*n<<' '<<s[j]+(t+k)*n<<' '<<(i+t*n)<<' '<<(j+(t+k)*n)<<' '<<(i+t*n-a+1)<<' '<<(b-j-(t+k)*n+1)<<endl;
            // }
        }
    }
    ans*=-1;
    upd(ans,mod);
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    LL T; cin>>T;
    while (T--) solve();
}