#include <iostream>
#include <cstdio>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;

const int N = 6e5 + 5, P = 998244353;

int n, a[N], suf[N], pre[N], c[N];

int fact[N << 1], infact[N << 1];

int inline power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % P;
		a = 1ll * a * a % P;
		b >>= 1;
	}
	return res;
}

int inline C(int a, int b) {
	if (a < b || a < 0 || b < 0) return 0;
	return 1ll * fact[a] * infact[b] % P * infact[a - b] % P;
}

void inline init(int n) {
	fact[0] = infact[0] = 1;
	for (int i = 1; i <= n; i++) fact[i] = (LL)fact[i - 1] * i % P;
	infact[n] = power(fact[n], P - 2);
	for (int i = n - 1; i; i--) infact[i] = infact[i + 1] * (i + 1ll) % P;
}

void inline add(int x) {
	for (; x <= n; x += x & -x) c[x] += 1;
}

int inline ask(int x) {
	int res = 0;
	for (; x; x -= x & -x) res += c[x];
	return res;
}

void inline clear() {
	for (int i = 1; i <= n; i++) c[i] = 0;
}

int inline f(int n, int m) {
	return (C(n + m, m) - C(n + m, n + 1) + P) % P;
}

void inline add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

int main() {
	init(1200000);
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) scanf("%d", a + i);
		for (int i = 1; i <= n; i++) {
			pre[i] = ask(a[i]);
			suf[i] = (n - a[i]) - (i - 1 - pre[i]);
			add(a[i]);
		}
		int ans = 0;
		int d = n;
		for (int i = 1; i <= n; i++) {
			if (suf[i] == 0) break;
			bool o = 0;
			if (suf[i] < d) d = suf[i], o = 1;
			add(ans, f(n - i + 1, d - 1));
			if (!o && pre[i] != a[i] - 1) break;
		}
		printf("%d\n", ans);
		clear();
	}
	return 0;
}