#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


void experiment() {
  for (int n = 1; n <= 10; ++n) {
    int cnt = 0;
    vector<int> freq(n, 0);
    vector<int> ps(n);
    for (int i = 0; i < n; ++i) {
      ps[i] = i;
    }
    do {
      int iv = 0, sum = 0;
      for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) if (ps[i] > ps[j]) {
        ++iv;
      }
      for (int i = 0; i < n; ++i) {
        sum += abs(i - ps[i]);
      }
      bool avoid = true;
      for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) for (int k = j + 1; k < n; ++k) {
        avoid = avoid && !(ps[i] > ps[j] && ps[j] > ps[k]);
      }
      if (2 * iv == sum) {
        ++cnt;
        ++freq[ps[0]];
        cout << ps << endl;
      }
      assert((2 * iv == sum) == avoid);
    } while (next_permutation(ps.begin(), ps.end()));
    cerr << n << ": " << cnt << " " << freq << endl;
  }
}


constexpr int LIM_INV = 1'200'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}


int N;
vector<int> Q;

Mint path(int x, int y) {
  return (x >= 0 && y >= 0) ? (fac[x + y] * invFac[x] * invFac[y]) : 0;
}

// (x, y) to (N, N), never below diagonal
Mint calc(int x, int y) {
  assert(0 <= x); assert(x <= y); assert(y <= N);
  return path(N - x, N - y) - path(N - (y + 1), N - (x - 1));
}

int main() {
  prepare();
  // experiment();
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    Q.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &Q[i]);
      --Q[i];
    }
    
    Mint ans = 0;
    // (i, y) on path
    int y = 0;
    vector<int> used(N + 1, 0);
    // next to use (if below path)
    int a = 0;
    for (int i = 0; i < N; ++i) {
      for (; used[a]; ++a) {}
// cerr<<"i = "<<i<<", a = "<<a<<endl;
      // greater than Q[i]
      {
        // below path
        if (a < y && Q[i] < a) {
// cerr<<"  below "<<calc(i + 1, y)<<endl;
          ans += calc(i + 1, y);
        }
        // on path
        const int yy = max(y + 1, Q[i] + 2);
        if (yy <= N) {
// cerr<<"  on "<<calc(i, yy)<<endl;
          ans += calc(i, yy);
        }
      }
      // Q[i]
      {
        if (a < y && Q[i] == a) {
          // below path
        } else if (y <= Q[i]) {
          // on path
          y = Q[i] + 1;
        } else {
          break;
        }
        used[Q[i]] = 1;
      }
    }
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}