#include <bits/stdc++.h>
#define N 131073
#define mod 998244353
using namespace std;

inline int rd() {
  int x = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    x = x * 10 + (c ^ 48);
    c = getchar();
  }
  return x;
}

inline int qpow(int x, int t) {
  int res = 1;
  while (t) {
    if (t & 1) res = 1ll * res * x % mod;
    x = 1ll * x * x % mod; t >>= 1;
  }
  return res;
}

inline int mo(int x) {return x >= mod ? x - mod : x;}

int rev[N], a[N], b[N], f[N];

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

inline void NTT(int *f, int len, int o) {
  for (int i = 1; i < len; ++i)
    if (i > rev[i]) swap(f[i], f[rev[i]]);
  for (int i = 1; i < len; i <<= 1) {
    int wn = qpow(3, (mod - 1) / (i << 1));
    if (o == -1) wn = qpow(wn, mod - 2);
    for (int j = 0; j < len; j += (i << 1)) {
      int w = 1, x, y;
      for (int k = 0; k < i; ++k, w = 1ll * w * wn % mod) {
        x = f[j + k]; y = 1ll * w * f[i + j + k] % mod;
        f[j + k] = mo(x + y); f[i + j + k] = mo(x - y + mod);
      }
    }
  }
  if (o == -1) {
    int invl = qpow(len, mod - 2);
    for (int i = 0; i < len; ++i) f[i] = 1ll * f[i] * invl % mod;
  }
}

void solve(int l, int r) {
  if (l == r) {
    if (l == 2) {f[l] = 2; return;}
    f[l] = mo(f[l] + 1ll * (l - 1) * f[l - 1] % mod);
    return;
  }
  int mid = (l + r) >> 1;
  solve(l, mid);
  int len = Rev((r - l) << 1);
  for (int i = l; i <= mid; ++i) a[i - l] = 1ll * (i - 1) * f[i] % mod;
  for (int i = mid + 1 - l; i < len; ++i) a[i] = 0;
  for (int i = l; i <= r; ++i) b[i - l] = f[i - l];
  for (int i = r + 1 - l; i < len; ++i) b[i] = 0;
  NTT(a, len, 1); NTT(b, len, 1);
  for (int i = 0; i < len; ++i) a[i] = 1ll * a[i] * b[i] % mod;
  NTT(a, len, -1);
  for (int i = mid + 1; i <= r; ++i) f[i] = mo(f[i] + a[i - l]);
  if (l != 2 && r > l + 1) {
    for (int i = l; i <= mid; ++i) a[i - l] = f[i];
    for (int i = mid + 1 - l; i < len; ++i) a[i] = 0;
    for (int i = l; i <= r; ++i) b[i - l] = 1ll * f[i - l] * (i - l - 1) %mod;
    for (int i = r + 1 - l; i < len; ++i) b[i] = 0;
    NTT(a, len, 1); NTT(b, len, 1);
    for (int i = 0; i < len; ++i) a[i] = 1ll * a[i] * b[i] % mod;
    NTT(a, len, -1);
    for (int i = mid + 1; i <= r; ++i) f[i] = mo(f[i] + a[i - l]);
  }
  solve(mid + 1, r);
}

int t, n, l[N], stk[N], top;

inline void work() {
  top = 0;
  int ans = 1;
  for (int i = 1; i <= n; ++i) l[i] = rd();
  if (l[n] != n || l[1] != 1) {puts("0"); return;}
  for (int i = 1, cnt; i <= n; ++i) {
    cnt = 0;
    while (top && stk[top] >= i - l[i] + 1) {
      if (i - l[i] > stk[top] - l[stk[top]]) {puts("0"); return;}
      --top; ++cnt;
    }
    stk[++top] = i;
    ans = 1ll * ans * f[cnt] % mod;
  }
  printf("%d\n", ans);
}

int main() {
  t = rd(); n = rd();
  if (n > 2) solve(2, n - 1);
  f[0] = 1; f[1] = 2;
  while (t--) work();
  return 0;
}