#include<bits/stdc++.h>
const int mod = 1000000007;
const int inv6 = 166666668;
const int inv2 = 500000004;
int n;
long long a,b;
int s[2005];
long long sum0(long long l, long long r) {
    return (r - l + 1)%mod;
}
long long sum1(long long R) {
    if (R < 0) return 0;
    R %= mod;
    return 1ll * R * (R + 1) %mod * inv2 % mod;
}
long long sum1(long long l, long long r) {
    return ( sum1(r) - sum1(l - 1) + mod ) %mod;
}
long long sum2(long long R) {
    if (R < 0) return 0;
    R %= mod;
    return R * (R + 1) %mod * (2 * R + 1) %mod * inv6 % mod;
}
long long sum2(long long l, long long r) {
    return ( sum2(r) - sum2(l - 1) + mod ) %mod;
}
long long sum3(long long R) {
    if (R < 0) return 0;
    return sum1(R) * sum1(R) % mod;
}
long long sum3(long long l, long long r) {
    return ( sum3(r) - sum3(l - 1) + mod ) %mod;
}

long long solve(int i,int j) {
    long long l1 = (a - i + n - 1) / n;
    long long r1 = (b - i) / n;
    long long l2 = (a - j + n - 1) / n;
    long long r2 = (b - j) / n;
    if (l1 < 0) l1 = 0;
    if (l2 < 0) l2 = 0;
    if (j + n * r2 > b) r2 --;
    if (i + n * r1 > b) r1 --;
    int t = ( s[j] - s[i] ) / n;
    r2 += t;
    l2 += t;
    long long r = std::min(r1,r2), l = std::max(l1,l2);
    if (l > r) return 0;
    // printf("%d,%d [%d,%d]\n",i,j,l,r);
    long long C1 = (b - i + 1 + mod) % mod;;
    long long C2 = ((j - t * n - a + 1) % mod + mod) % mod;
    long long A = (mod - 1ll*n*n*n%mod);
    long long B = 1ll * n * n * (-C2 + C1 - s[i] + 2 * mod) % mod;
    long long C = 1ll * n * ((C1 * C2 - s[i] * C2 + s[i] * C1) % mod + mod )% mod;
    long long D = 1ll * s[i] * C1 % mod * C2 % mod; 
    long long ans = 0;
    ans += A * sum3(l,r) %mod;
    ans += B * sum2(l,r) %mod;
    ans += C * sum1(l,r) %mod;
    ans += D * sum0(l,r) %mod;
    // printf("[%d,%d]%lld\n",i,j,ans);
    return ans % mod;
}
void solve() {
    std::cin >> n >> a >> b;
    for(int i=0;i<n;i++) {
        std::cin >> s[i];
    }
    int ans = 0;
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) if ((s[j] - s[i]) % n == 0){
            if (s[j] > s[i]) {
                ans+=solve(i,j);
            }
            else if (s[i] > s[j]) {
                ans+=solve(j,i);
            }
            else {
                ans+=solve(std::max(i,j),std::min(i,j));
            }
            ans%=mod;
        }
    }
    printf("%d\n",ans);
}
int main() {
//      freopen("in.txt","r",stdin);
//    freopen("out2.txt","w",stdout);
	std::ios::sync_with_stdio(0);std::cin.tie(0);
    int T;
    std::cin >> T;
    while(T--) {
        solve();
    }
}