#ifdef MY_LOCAL
#include "D://competitive_programming/debug/debug.h"
#define debug(x) cerr << "[" << #x<< "]:"<<x<<"\n"
#else
#define debug(x) 
#endif
#define REP(i, n) for(int i = 0; i < (n); i ++)
#define REPL(i,m, n) for(int i = (m); i < (n); i ++)
#define SORT(arr) sort(arr.begin(), arr.end())
#define LSOne(S) ((S)&-(S))
#define sz(X) ((int)X.size())
#define READ(arr) for(auto &a: arr){cin>>a;}
#define SUM(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef tree<int,null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ost;
const ll INF = 1e18;
const int MOD = 998244353;
int solve() {
	int n,c;cin>>n>>c;
	vi parr(n);
	READ(parr);
	vi places(n);
	REP(i, n) {
		parr[i]--;
		places[parr[i]] = i;
	}
	set<int> fixedpoint = {-1, n};
	auto ptr_to_left = [&](int idx) {
		return *prev(fixedpoint.upper_bound(idx));
	};
	auto ptr_to_right = [&](int idx) {
		return *fixedpoint.upper_bound(idx);
	};

	map<int, ii> ranges;
	auto get_range = [&](int who) {
		auto it = ranges.upper_bound(who);
		if (it == ranges.begin()) {
			return -1LL;
		} 
		it = prev(it);
		if ((it->second).first < who) {
			return -1LL;
		}
		return it->first;
	};
	int ans = 1;
	auto add_range = [&](int l, int r) {
		//debug("adding");debug(l);debug(r);
		int vl = get_range(l);
		int vr = get_range(r);
		if (vl == -1LL && vr == -1LL) {
			//debug("none!");
			ranges[l] = {r, 0};return;
		}
		if (vl == vr) return;
		if (vl != -1) {
			assert(vr == -1);
			auto it = ranges.find(vl);
			auto [L, pr] = *it;
			auto [R, amt] = pr;
			ranges.erase(it);
			ranges.insert({L, {r, amt}});
		}
		if (vr != -1) {
			assert(vl == -1);
			auto it = ranges.find(vr);
			auto [L, pr] = *it;
			auto [R, amt] = pr;
			ranges.erase(it);
			ranges.insert({l, {R, amt}});
		}
	};
	REP(i, n) {
		auto idx = places[i];
		//debug(idx);debug(ranges);
		auto where = get_range(idx);
		if (where != -1) {
			auto [r, occ] = ranges[where];
			int rem = r - where + 1 - occ;
			ranges[where].second++;
			assert(rem > 0);
			ans *= rem;
			ans %= MOD;
		}
		// try to add pt...
		int lfixed = ptr_to_left(idx);
		if (idx - c > lfixed) {
			add_range(idx - c, idx -1);
		}
		int rfixed = ptr_to_right(idx);
		if (idx + c < rfixed) {
			add_range(idx + 1, idx + c);
		}
		if (where == -1) {
			fixedpoint.insert(idx);
		}
	}
	return ans;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tc;
	cin>>tc;
	REP(i, tc) {
		cout<<solve()<<"\n";
	}

}