#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int factorial(int n) {
  int result = 1;
  for (int i = 2; i <= n; ++i) {
    result = (result * i) % MOD;
  }
  return result;
}int modInverse(int a) {
  int result = 1;
  int exp = MOD - 2;
  while (exp > 0) {
    if (exp % 2 == 1) {
      result = (result * a) % MOD;
    }
    a = (a * a) % MOD;
    exp /= 2;
  }
  return result;
}int countValidShuffles(const std::vector<int>& Y, const int k) {
  int n = Y.size();
  int invFactorialN = modInverse(factorial(n));
  int product = 1;
  for (int i = 0; i < n; ++i) {
    int x = i + 1;
    if (Y[i] != x) {
      product = (product * (Y[i] - 1)) % MOD;
    }
  }

  return (product * invFactorialN) % MOD;
}int main() {
  int T;
  std::cin >> T;
  for (int t = 0; t < T; ++t) {
    int n, k;
    cin >> n >> k;
    vector<int> Y(n);
    for(int i = 0; i < n; ++i) {
      cin>>Y[i];
    }
    int result = countValidShuffles(Y, k);
    cout << result << std::endl;
  }
  return 0;
}