#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define fi first
#define se second
//#define fi(x) (x->first)
//#define se(x) (x->second)
#define N 1111111
#define mod 998244353ll
ll n, a[N], m, t, fac[N] = {1};
ll bigmul(ll a, ll b, ll m) {
  unsigned long long c =
	  (unsigned long long)a * b -
	  (unsigned long long)((long double)a / m * b + 0.5L) * m;
  return (c + m) % m;
}
ll qpow(ll x, ll y){
	ll ans = 1, res = x % mod ;
	while(y){
		if(y & 1)
			ans = bigmul(ans, res, mod);
		res = bigmul(res, res, mod);
		y >>= 1 ;
	}
	return ans ;
}
ll inv(ll x){
	return qpow(x, mod - 2);
}
ll c(ll x, ll y){
	return fac[x] * inv(fac[y]) % mod * inv(fac[x - y]) % mod;
}
int main(){
	for(int i = 1 ; i < N ; i++)
		fac[i] = fac[i - 1] * i % mod;
	scanf("%lld", &t);
	while(t--){
		scanf("%lld%lld", &n, &m);
		for(int i = 1 ; i <= m ; i++){
			scanf("%lld", &a[i]);
		}
		if(*min_element(a + 1, a + 1 + m) == 0){
			printf("%lld\n", fac[n - m] * c(n, m) % mod);
			continue;
		}
		if(m == 1){
			printf("%lld\n", fac[n]);
		}
	}
	return 0;
}
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);

*/