// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[33m[" << __LINE__ << "]\033[0m "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1.2e7 + 10, MOD = 998244353;
inline void add(int &x, ll y) {x = (x + y) % MOD;}
int n, a[N];
int fac[N], ifac[N], inv[N];
inline void binom(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	F(i, 2, x) inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
	F(i, 1, x) fac[i] = (ll) fac[i - 1] * i % MOD, ifac[i] = (ll) ifac[i - 1] * inv[i] % MOD;
}
inline int C(int x, int y) {return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;}
bool vis[N];
int path(int a, int b, int c, int d) {
	return C(c + d - a - b, c - a);
}
int calc(int x, int y) { // -> (n, n)
	return ((ll) path(x, y, n, n) - path(x, y, n + 1, n - 1) + MOD) % MOD;
}
void zhk() {
	read(n);
	F(i, 1, n) vis[i] = false;
	F(i, 1, n) read(a[i]);
	int ans = 0, mx = 0, pos = 1;
	F(i, 1, n) {
		add(ans, calc(i - 1, max(a[i], mx) + 1));
		// debug << i << " " << ans << endl;
		while (vis[pos]) pos++;
		if (a[i] < mx && a[i] != pos) break;
		if (a[i] > mx) mx = a[i];
		vis[a[i]] = true;
	}
	cout << ans << '\n';
}
signed main() {
	binom(1.2e7 + 5);
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/