#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9+7;
template<long long P>
struct ModInt {
public:
    ModInt() : v(0) {}

    template<typename T>
    ModInt(T x) { v = ((long long) x % P + P) % P; }

    long long val() const { return v; }

    ModInt &operator++() {
        ++v;
        if (v == P)
            v = 0;
        return *this;
    }

    ModInt &operator--() {
        if (v == 0)
            v = P;
        --v;
        return *this;
    }

    ModInt operator++(int) {
        ModInt oldVal = *this;
        ++*this;
        return oldVal;
    }

    ModInt operator--(int) {
        ModInt oldVal = *this;
        --*this;
        return oldVal;
    }

    ModInt &operator+=(const ModInt &rhs) {
        v += rhs.v;
        v %= P;
        return *this;
    }

    ModInt &operator-=(const ModInt &rhs) {
        v -= rhs.v;
        v = (v + P) % P;
        return *this;
    }

    ModInt &operator*=(const ModInt &rhs) {
        v *= rhs.v;
        v %= P;
        return *this;
    }

    ModInt &operator/=(const ModInt &rhs) { return *this = *this * rhs.inv(); }

    ModInt operator+() const { return *this; }

    ModInt operator-() const { return ModInt() - *this; }

    ModInt pow(long long exp) const {
        // assert(exp>=0);
        ModInt res = 1;
        ModInt base = *this;
        while (exp) {
            if (exp & 1)
                res *= base;
            base *= base;
            exp >>= 1;
        }
        return res;
    }

    ModInt inv() const {
        // assert(v);
        return pow(P - 2);
    }

    friend ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res += rhs;
        return res;
    }

    friend ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res -= rhs;
        return res;
    }

    friend ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res *= rhs;
        return res;
    }

    friend ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
        ModInt res = lhs;
        res /= rhs;
        return res;
    }

    friend bool operator==(const ModInt &lhs, const ModInt &rhs) { return lhs.v == rhs.v; }

    friend bool operator!=(const ModInt &lhs, const ModInt &rhs) { return lhs.v != rhs.v; }

    friend std::istream &operator>>(std::istream &is, ModInt &aim) {
        long long tmp;
        is >> tmp;
        aim = ModInt(tmp);
        return is;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt &aim) { return os << aim.val(); }

private:
    long long v;
};

using mint = ModInt<MOD>;
mint fact[200005];
mint infact[200005];

void init() {
    infact[0] = fact[0] = 1;
    for (int i = 1; i <= 100002; i++)
        fact[i] = fact[i - 1] * i, infact[i] = infact[i - 1] / i;
}

mint C(int a, int b) {
    if (a < b || a < 0 || b < 0) return 0;
    return fact[a] * infact[b] * infact[a - b];
}
int a[100005];
void Solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 2; i <= n ;i++) {
        if(a[i] > n-1 || a[i] < i-1) {
            cout<<0<<"\n";
            return;
        }
        if(a[i] < a[i-1]){
            cout<<0<<"\n";
            return;
        }
    }
    if (a[1] != 0 || a[n] != n - 1) {
        cout<<0<<"\n";
        return;
    }
    if (n == 1) {
        cout<<1<<"\n";
        return;
    }
    if (n == 2) {
        cout<<2<<"\n";
        return;
    }
    mint ans = 2;
    if(a[2] != n-1) {
        ans *= 2;
    }
    int rem = 0;
    for (int i = 2; i <= n; i++) {
        int num = 0;
        int ti = i;
        int nexti = i;
        for(int j = i + 1; j <= n ; j++ ) {
            if(a[j] == a[i])
                num++ , nexti = j;
            else {
                nexti = j - 1;
                break;
            }
        }
        i = nexti;
        rem += (a[ti] - a[ti-1] - 1) ;
        ans *= fact[num];
        ans *= C(rem,num);

    }
    cout<<ans<<"\n";

}

int main() {
    init();
    int t;
    cin >> t;
    while(t--) {
        Solve();
    }
}