#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 1000010
#define LL long long
#define mod 1000000007
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int T,n,a[N];
int st[N],top,L[N],R[N];
LL inv[N];
int main() {
	inv[0]=inv[1]=1;
	rep(i,2,N-10) inv[i]=mod-mod/i*inv[mod%i]%mod;
	
	T=rd();
	while(T--) {
		n=rd();
		rep(i,1,n) a[i]=rd();
		
		top=0;
		rep(i,1,n) {
			while(top&&a[i]>a[st[top]]) R[st[top]]=i-1,top--;
			st[++top]=i;
		}
		while(top) R[st[top]]=n,top--;
		
		drep(i,n,1) {
			while(top&&a[i]>=a[st[top]]) L[st[top]]=i+1,top--;
			st[++top]=i;
		}
		while(top) L[st[top]]=1,top--;
		
		LL ans=1;
		rep(i,1,n) ans=ans*inv[R[i]-L[i]+1]%mod/*,cerr<<"FUCK "<<i<<' '<<L[i]<<' '<<R[i]<<endl*/;
		printf("%lld\n",ans*n%mod*inv[2]%mod);
	}
	return 0;
}