#include<bits/stdc++.h>
#define F(i,j,k) for(i=(j);i<=(k);++i)
#define D(i,j,k) for(i=(j);i>=(k);--i)
using namespace std;
#define TIME 1e3*clock()/CLOCKS_PER_SEC
bool OP; double Mbe=TIME;
constexpr int N=2000003,mod=1000000007;
inline int read()
{
    int x=0,y=1;char ch=getchar();
    for(;ch<48||ch>57;ch=getchar()) if(ch=='-') y=-1;
    while(ch>=48&&ch<=57) x=x*10+(ch&15),ch=getchar();
    return x*y;
}
typedef long long LL;
inline int qpow(int base,int k=mod-2)
{
    int res=1;
    while(k)
    {
        if(k&1) res=(LL)res*base%mod;
        base=(LL) base*base%mod;
        k>>=1;
    }
    return res;
}
int n,ans=1,a[N],sz[N],ls[N],rs[N],stk[N],top;
int fac[N],inv[N];
void dfs(int u)
{
    sz[u]=1;
    if(ls[u]) dfs(ls[u]),sz[u]+=sz[ls[u]];
    if(rs[u]) dfs(rs[u]),sz[u]+=sz[rs[u]];
    ans=(LL)ans*inv[sz[u]]%mod;
}
int rt;
inline void mian()
{
    int i,j,u,v;
    n=read();
    //大根笛卡尔树
    top=0,ans=1;
    F(i,1,n) ls[i]=rs[i]=stk[i]=0;
    F(i,1,n)
    {
        a[i]=read();
        while(top&&a[stk[top]]<a[i]) ls[i]=stk[top--];
        if(top) rs[stk[top]]=i;
        else rt=i;
        stk[++top]=i;
    }
    dfs(rt);
    printf("%d\n",(LL)ans*inv[2]%mod*n%mod);
}
bool ED;
signed main()
{
    //fprintf(stderr,"%.4lf MB\n",(&OP-&ED)/1048576.0);
    //#define Marsrayd //Look Out！
    #ifdef Marsrayd
        assert(freopen("data.in","r",stdin));
        assert(freopen("zj.out","w",stdout));
    #endif
    int i,j;
    fac[0]=1;
    F(i,1,1000000) fac[i]=(LL)fac[i-1]*i%mod;
    j=qpow(fac[1000000]);
    D(i,1000000,1) inv[i]=(LL)j*fac[i-1]%mod,j=(LL)j*i%mod;
    for(int T=read();T--;mian());
    //fprintf(stderr,"time = %.4lf ms\n",TIME-Mbe);
    return 0;
}