#include<bits/stdc++.h>
using namespace std;
#define int long long
const int NN=1e9+7;
int p[100100],ni[100100];
int n,a[100100];
int mi(int x,int y){
	int sum=1;
	for (;y;y>>=1,x=x*x%NN)
	if(y&1)sum=sum*x%NN;
	return sum;
}
int c(int x,int y){
	if(x<0||y<0||x<y)return 0;
	return p[x]*ni[x-y]%NN;
}
void solve(){
	cin>>n;
	for (int i=1;i<=n;i++)
	cin>>a[i];
	int pre=n-1;
	int ans=1;
	for (int i=n;i>=1;i--){
		if(a[i]!=pre){
			ans=ans*2%NN*c(pre-i,pre-a[i]-1)%NN;
			if(ans==0)break;
			pre=a[i];
		}
	}
	cout<<ans<<"\n";
}
signed main(){
	int N=1e5;
	p[0]=1;
	for (int i=1;i<=N;i++)
	p[i]=p[i-1]*i%NN;
	ni[N]=mi(p[N],NN-2);
	for (int i=N;i;i--)
	ni[i-1]=ni[i]*i%NN;
	int T;cin>>T;
	while(T--)solve();
}