Brute-Force

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,ll*A){F(N)scanf("%lld",A+i);}
#define MOD (1000000007)
#define MX (1<<24)
int B,E,N,K,L,H,S;
ll U[MX],V[MX];
void sim(){
    H=N,S=0;
    F(K){
        L=H,memcpy(U,V,sizeof(U)),H=0;
        F(L-1)V[H++]=U[i],V[H++]=(U[i]+U[i+1])%MOD;
        V[H++]=U[L-1];
    }
}
int main(void){
    IN(tt)F(tt){
        scanf("%d%d%d%d",&N,&K,&B,&E),ga(N,V);
        sim();
        assert(B<=E),assert(E<=H);
        FT(B-1,E)S+=V[k],S%=MOD;
        printf("%d\n",S);
    }
    return 0;
}