#include <bits/stdc++.h>

using namespace std;

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

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> void inline read(T &x) {
	x = 0; int f = 1; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') { f = -1; } s = getchar(); }
	while (s >= '0' && s <= '9') x = x * 10 + (s ^ 48), s = getchar();
	x *= f;
}

template <typename T> bool inline chkMax(T &x, T y) { return y > x ? x = y, 1 : 0; }
template <typename T> bool inline chkMin(T &x, T y) { return y < x ? x = y, 1 : 0; }

const int N = 150005, P = 998244353, G = 3;

int T, n, f[N], a[N], top;

PII s[N];

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

typedef vector<int> Poly;

#define pb push_back

int A[N], rev[N], mod, inv[N];
int lim = 1, len = 0, W[18][N];

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


int Gi = power(G, P - 2, P), inv2 = power(2, P - 2, P);

void inline NTT(int c[], int lim, int o) {
	for (int i = 0; i < lim; i++)
		if (i < rev[i]) swap(c[i], c[rev[i]]);
	for (int k = 1, t = 0; k < lim; k <<= 1, t++) {
		for (int i = 0; i < lim; i += (k << 1)) {
			for (int j = 0; j < k; j++) {
				int u = c[i + j], v = (LL)c[i + k + j] * W[t][j] % P;
				c[i + j] = u + v >= P ? u + v - P : u + v;
				c[i + j + k] = u - v < 0 ? u - v + P : u - v; 
			}
		}
	}
	if (o == -1) {
		reverse(c + 1, c + lim);
		int inv = power(lim, P - 2, P);
		for (int i = 0; i < lim; i++)
			c[i] = (LL)c[i] * inv % P;
	}
}

void inline setN(int n) {
	lim = 1, len = 0;
	while (lim < n) lim <<= 1, len++;
	for (int i = 0; i < lim; i++)
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (len - 1));
}

Poly inline NTT(Poly a, int o) {
	int n = a.size();
	for (int i = 0; i < n; i++) A[i] = a[i];
	NTT(A, lim, o);
	a.clear();
	for (int i = 0; i < lim; i++) a.push_back(A[i]), A[i] = 0;
	return a;
}

Poly operator + (const Poly a, const Poly b)  {
	Poly c(max(a.size(), b.size()));
	for (int i = 0; i < c.size(); i++) {
		if (i < a.size()) {
			c[i] += a[i]; if (c[i] >= P) c[i] -= P;
		}
		if (i < b.size()) {
			c[i] += b[i]; if (c[i] >= P) c[i] -= P;
		}
	}
	return c;
}

Poly inline mul (Poly a, Poly b, int newn = -1) {
	if (newn == -1) newn = a.size() + b.size() - 1;
	setN(a.size() + b.size() - 1);
	Poly c = NTT(a, 1), d = NTT(b, 1);
	for (int i = 0; i < lim; i++) c[i] = (LL)c[i] * d[i] % P;
	d = NTT(c, -1); d.resize(newn);
	return d;
}


// 鐢ㄥ埌鐨勬渶澶х殑 n
void inline init(int n) {
	setN(2 * n);
	for (int k = 1, t = 0; k < lim; k <<= 1, t++) {
		int wn = power(G, (P - 1) / (k << 1));
		W[t][0] = 1;
		for (int j = 1; j < k; j++) W[t][j] = (LL)W[t][j - 1] * wn % P;
	}
}

void inline del(int &x, int y) {
	x -= y;
	if (x < 0) x += P;
}


void solve(int l, int r) {
	if (l == r) {
		if (r > 1) {
			if (r % 2 == 0) del(f[r], 1ll * f[r / 2] * f[r / 2] % P);
			f[r] = 1ll * f[r] * (r - 2) % P * inv2 % P;
			if (r % 2 == 0) add(f[r], 1ll * f[r / 2] * f[r / 2] % P * (r / 2 - 1) % P);
			del(f[r], 1ll * f[1] * (r - 2) % P * f[r - 1] % P);
			add(f[r], 1ll * f[r - 1] * (r - 1) % P);
		}
		return;
	}
	int mid = (l + r) >> 1;
	solve(l, mid);
	// calc F * F -> F
	Poly A, B;
	for (int i = l; i <= mid; i++) A.pb(f[i]);
	B.pb(0);
	for (int i = 1; i <= min(r - l, mid); i++) {
		int w = f[i];
		if (i < l) w = w * 2 % P;
		B.pb(w);
	}
	A = mul(A, B);
	for (int i = mid + 1; i <= r; i++) {
		int p = i - l;
		if (p < A.size()) add(f[i], A[p]);
	}
	solve(mid + 1, r);
}

void inline prework() {
	f[0] = 1;
	f[1] = 2;
	solve(1, n);
}

void inline work() {
	if (a[n] != n) {
		puts("0");
		return;
	}
	top = 0;
	int ans = 1;
	for (int i = 1; i <= n; i++) {
		int c = 0;
		int L = i - a[i] + 1;
		while (top && s[top].se >= L) {
			if (s[top].fi < L) {
				puts("0");
				return;
			}
			c++;
			top--;
		}
		ans = 1ll * ans * f[c] % P;
		s[++top] = mp(L, i);
	}
	printf("%d\n", ans);
}

int main() {
	read(T), read(n); init(n);
	prework();
	while (T--) {
		for (int i = 1; i <= n; i++) read(a[i]);
		work();
	}
}