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

inline void read(int &x){
	static char c; x = 0,c = getchar();
	while (!isdigit(c)) c = getchar();
	while (isdigit(c)) x = x * 10 + c - '0',c = getchar();
}

const int P = 1e9 + 7,N = 1000050;
int n,a[N],st[N][20],Log[N];
long long ans;

int power(int x,int y){
	static long long res;
	res = 1;
	while (y){ if (y&1) res = res * x % P; x = 1ll*x*x%P; y>>=1; } return res;
}
void dfs(int l,int r){
	int t = Log[r-l+1],x = st[l][t],y = st[r-(1<<t)+1][t];
	int z = (a[x] != a[y]) ? ((a[x] > a[y])?x:y) : min(x,y);
	if (l<z) dfs(l,z-1); if (z<r) dfs(z+1,r);
	ans = ans * (r - l + 1ll) % P;
}

void solve(){
	int i,j,x,y;
	read(n);
	for (i = 2; i <= n; ++i) Log[i] = Log[i >> 1] + 1;
	for (i = 1; i <= n; ++i) read(a[i]),st[i][0] = i;
	for (i = 1; i <= Log[n]; ++i)
	for (j = 1; j+(1<<i)-1 <= n; ++j){
		x = st[j][i-1],y = st[j + (1<<(i-1))][i-1];
		st[j][i] = (a[x] != a[y]) ? ((a[x] > a[y])?x:y) : min(x,y);
	}
	ans = 1;
	dfs(1,n);
	ans = power(ans,P-2);
	ans = ans * n % P * (P+1>>1) % P;
	cout << ans << '\n'; 
}

int main(){
	int T;
	read(T);
	while (T--) solve();
	return 0;
}