#define _CRT_SEstartE_NO_DEPRECATE
#pragma warning(disable : 4996)
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <bits/stdc++.h>
#define ACcode ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 2e6 + 7;
const ll maxm = 7e6 + 7;
constexpr ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int Prime = 100007;
const double eps = 1e-5;
const double pi = acos(-1.0);
using namespace std;

int fac[maxn], inv[maxn];
void init()
{
    fac[0] = 1;
    for (int i = 1; i < maxn; i++)
        fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[1] = 1;
    for (int i = 2; i < maxn; i++)
        inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
    inv[0] = 1;
    for (int i = 1; i < maxn; i++)
        inv[i] = 1ll * inv[i - 1] * inv[i] % mod;
}
int C(int a, int b)
{
    if (a < b || b < 0)
        return 0;
    return 1ll * fac[a] * inv[b] % mod * inv[a - b] % mod;
}
int l[maxn], r[maxn], sz[maxn], n, a[maxn], root;
ll ans = 1;

void dfs(int x)
{
    sz[x] = 1;
    int leftsz = 0;
    if (l[x])
        dfs(l[x]), sz[x] += sz[l[x]];
    if (r[x])
        dfs(r[x]), sz[x] += sz[r[x]];
    ans = ans * C(sz[x] - 1, sz[l[x]]) % mod;
}

void build()
{
    stack<int> st;
    root = 0;
    for (int i = 1; i <= n; i++)
    {
        int last = 0;
        while (!st.empty() && a[st.top()] < a[i])
        {
            last = st.top();
            st.pop();
        }
        if (!st.empty())
            r[st.top()] = i;
        else
            root = i;
        l[i] = last;
        st.push(i);
    }
}

ll qpow(ll a, ll b)
{
    ll ans = 1;
    while (b)
    {
        if (b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod, b >>= 1;
    }
    return ans;
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i], l[i] = r[i] = 0;
    build();
    ans = 1;
    dfs(root);
    ll temp = 1;
    for (int i = 1; i <= n; i++)
        temp = temp * i % mod;
    cout << ans * qpow(temp, mod - 2) % mod * n % mod * qpow(2, mod - 2) % mod << '\n';
}

signed main()
{
    init();
    ACcode;
    // freopen("house.in", "r", stdin);
    // freopen("house.out", "w", stdout);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}