#include <bits/stdc++.h>


using namespace std;
typedef long long ll;

const int N = 5e3 + 12, MOD = (int)1e9 + 7;

int n, h[N], k;

ll binpow(ll a, ll b) {
    ll ret = 1, k = a;
    while(b) {
        if(b & 1) {
            ret *= k;
            ret %= MOD;
        }
        k *= k;
        k %= MOD;
        b /= 2;
    }
    return ret;
}
ll fact[N], fact1[N];
void init() {
    fact[0] = fact1[0] = 1;
    for(int i = 1; i < N; i++) {
        fact[i] = fact[i - 1] * 1ll * i % MOD;
        fact1[i] = binpow(fact[i], MOD - 2);
    }
}
ll ceis(int n, int k) {
    if(k > n) return 0;
    ll ob = fact1[k] * fact1[n - k] % MOD;
    return fact[n] * ob % MOD;
}
void make() {
    for(int i = 1; i <= n; i++) {
        int l, r, f;
        l = r = h[i];
        f = i;
        for(int j = i + 1; j <= n; j++) {
            if(h[j] < h[f]) {
                if(abs(l - h[j]) <= 1 && abs(r - h[j]) <= 1) {
                    f = j;
                }
            }
            l = min(l, h[j]);
            r = max(r, h[j]);
        }
        while(f != i) {
            swap(h[f], h[f - 1]);
            --f;
        }
    }
}
int dp[N][N];
void add(int &x, int y) {
    x += y;
    if(x >= MOD) x -= MOD;
}
int solve(vector<int> a) {
    vector<int> b;
    int m = (int)a.size();
    for(int i = 0; i < m; ) {
        int j = i + 1;
        while(j < m && a[j] == a[j - 1]) {
            j++;
        }
        b.push_back(j - i);
        i = j;
    }
    m = (int)b.size();
    dp[0][b[0]] = 1;
    for(int i = 0; i < b[0]; i++) {
        dp[0][i] = 0;
    }
    for(int i = 1; i < m; i++) {
        for(int j = 0; j <= b[i]; j++) {
            dp[i][j] = 0;
            for(int l = 0; l <= b[i - 1]; l++) {
                if(j != b[i] && !l) continue;
                add(dp[i][j], dp[i - 1][l] * 1ll * ceis(b[i] - j + l - 1, b[i] - j) % MOD);
            }
        }
    }
    int ret = 0;
    for(int f = 0; f < m; f++) {
        for(int i = 0; i <= b[f]; i++) {
            add(ret, dp[f][i]);
        }
    }
    ret--;
    if(ret < 0) ret += MOD;
    return ret;
}
void test() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> h[i];
    }
    make();
    int res = 1;
    for(int i = 1; i <= n; ) {    
        int j = i + 1;
        vector<int> a(1, h[i]);
        while(j <= n && h[j] <= h[j - 1] + 1) {
            a.push_back(h[j]);
            j++;
        }
        res = res * 1ll * solve(a) % MOD;
        i = j;
    }

    cout << res << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    init();

    int t = 1;
    cin >> t;

    while(t--) {
        test();
    }
}