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

#define REP(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;++i)
#define ll long long

static const int M=100003;
static const int Mod=1000000007;

int T,n,A[M],Inv[M];
ll AP,BP,B[M];
int main(){

  Inv[0]=Inv[1]=1;
  REP(i,2,M)
    Inv[i]=1ll*(Mod-Mod/i)*Inv[Mod%i]%Mod;

  scanf("%d",&T);
  while(T--){
    scanf("%d",&n);
    scanf("%lld%lld",&AP,&BP);
    REP(i,0,n)scanf("%d",&A[i]);

    ll Ans=0;
/*
    ll Tmp=0;
    REP(i,0,n)B[i]=A[i];
    REP(i,n,BP+1)B[i]=B[i-n]+n;
    REP(i,AP,BP+1)REP(j,AP,BP+1)
      if( B[i]==B[j]){
        Tmp+=B[i]*(min(i,j)-AP+1)*(BP-max(i,j)+1);
        //cout<<i<<','<<j<<','<<B[i]<<','<<B[j]<<endl;
      }
    cout<<Tmp<<endl;
*/
    REP(i,0,n)REP(j,0,n){
      if(!((A[i]-A[j])%n)){
        ll t=(A[i]-A[j])/n;
        ll l=i,r=j,p;
        if(t<0)p=A[l]-t*n,l-=t*n;
        else p=A[r]+t*n,r+=t*n;

        if(l>r)swap(l,r);
        t=llabs(t)*n;
        t=n;
        
        //cerr<<l<<','<<r<<','<<p<<endl;
        if(l<AP){
          ll add=(AP-l+t-1)/t*t;
          l+=add,r+=add,p+=add;
        }

        if(r>BP)continue;
        //cerr<<l<<','<<r<<','<<p<<endl;

        ll m=(BP-r)/t+1;
        ll x=(l-AP+1)%Mod;
        ll y=(BP-r+1)%Mod;
        p%=Mod;
        t%=Mod;

        ll s0=m%Mod;
        ll s1=(m-1)%Mod*(m%Mod)%Mod*Inv[2]%Mod;
        ll s2=(m-1)%Mod*(m%Mod)%Mod*((2*m-1)%Mod)%Mod*Inv[6]%Mod;
        ll s3=s1*s1%Mod;
        //if(t!=8 || l==r)continue;
        //cout<<"***"<<l<<','<<r<<','<<x<<','<<y<<','<<p<<','<<t<<','<<m<<endl;

        (Ans+=s0*(x*y%Mod*p%Mod)%Mod )%=Mod;
        (Ans+=s1*(x*y%Mod*t%Mod)%Mod )%=Mod;
        (Ans+=s1*(y*p%Mod*t%Mod)%Mod )%=Mod;
        (Ans-=s1*(x*p%Mod*t%Mod)%Mod )%=Mod;
        (Ans-=s2*(x*t%Mod*t%Mod)%Mod )%=Mod;
        (Ans+=s2*(y*t%Mod*t%Mod)%Mod )%=Mod;
        (Ans-=s2*(p*t%Mod*t%Mod)%Mod )%=Mod;
        (Ans-=s3*(t*t%Mod*t%Mod)%Mod )%=Mod;
      }
    }
    printf("%lld\n",(Ans+Mod)%Mod);
  }
  return 0;
}