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

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

static const int M=1000003;
static const int Mod=1000000007;
#define ll long long

int T,n,Inv[M],A[M],B[M][21];
int Lg[M];
int Max(int a,int b){
  return A[a]>=A[b]?a:b;
}
ll Work(int l,int r){
  if(l>=r)return 1;
  int t=Lg[r-l+1];
  int u=Max(B[l][t],B[r-(1<<t)+1][t]);
  return 1ll*Inv[r-l+1]*Work(l,u-1)%Mod*Work(u+1,r)%Mod;
}
int main(){
  
  Inv[0]=Inv[1]=1;
  REP(i,2,M)
    Inv[i]=1ll*(Mod-Mod/i)*Inv[Mod%i]%Mod;
  REP(i,2,M)Lg[i]=Lg[i>>1]+1;

  scanf("%d",&T);
  while(T--){
    scanf("%d",&n);
    REP(i,1,n+1)
      scanf("%d",&A[i]),B[i][0]=i;

    //cout<<"****"<<endl;
    REP(j,1,21)REP(i,1,n+1)if(i+(1<<j-1)<=n)
      B[i][j]=Max(B[i][j-1],B[i+(1<<j-1)][j-1]);
    
    //cout<<"****"<<endl;
    printf("%lld\n",1ll*Work(1,n)*n%Mod*Inv[2]%Mod);
  }
  return 0;
}