#include <bits/stdc++.h>
#define Mod 998244353
using namespace std;
int Qread()
{
	int x=0;char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
	return x;
}
int qpow(int a,int p)
{
	int ret=1;
	for(;p;p>>=1,a=1ll*a*a%Mod)
		if(p&1) ret=1ll*ret*a%Mod;
	return ret;
}
int fac[1200010],inv[1200010],n;
int C(int n,int m){return (m<0||m>n)?0:1ll*fac[n]*inv[m]%Mod*inv[n-m]%Mod;}
int chk(int a){return a<0?a+Mod:a;}
void add(int &a,int b){a+=b;if(a>=Mod) a-=Mod;}
int f(int i,int j){return (i>j||j>n)?0:chk(C(2*n-i-j-1,n-i-1)-C(2*n-i-j-1,n-j-2));}
int q[600010],mx,mn,ans;
bool vis[600010];
void solve()
{
	ans=0;
	n=Qread();mx=0,mn=1;
	memset(vis+1,0,n);
	for(int i=1;i<=n;i++)
		q[i]=Qread();
	for(int i=1;i<=n;i++)
	{
		add(ans,f(i-1,max(mx,q[i])+1));
		if(mx>q[i]&&q[i]>mn) break;
		mx=max(mx,q[i]);
		vis[q[i]]=true;
		while(vis[mn]) mn++;
	}
	printf("%d\n",ans);
}
int main()
{
	fac[0]=inv[0]=1;
	for(int i=1;i<=1200000;i++) fac[i]=1ll*fac[i-1]*i%Mod;
	inv[1200000]=qpow(fac[1200000],Mod-2);
	for(int i=1199999;i;i--) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
	int T=Qread();
	while(T--) solve();
	return 0;
}