#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;
	};
	auto get_data = [&](int who) {
		auto it = ranges.find(who);
		auto [L, pr] = *it;
		auto [R, occ] = pr;
		return make_tuple(L, R, occ);
	};
	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 && vr != -1) {
			assert(next(ranges.find(vl)) == ranges.find(vr));
			auto [L1, R1, occ1] = get_data(vl);
			auto [L2, R2, occ2] = get_data(vr);
			ranges.erase(L1);
			ranges.erase(L2);
			ranges[L1] = {R2, occ1 + occ2};
		} else if (vl != -1) {
			auto [L, R, occ] = get_data(vl);
			ranges.erase(vl);
			ranges.insert({L, {r, occ}});
		} else if (vr != -1) {
			assert(vl == -1);
			auto [L, R, occ] = get_data(vr);
			ranges.erase(vr);
			ranges.insert({l, {R, occ}});
		}
	};
	REP(i, n) {
		auto idx = places[i];
		//debug(idx);debug(ranges);
		auto where = get_range(idx);
		if (where != -1) {
			auto [L, R, occ] = get_data(where);
			ranges[where].second++;
			int rem = R - L + 1 - occ;
			assert(rem > 0);
			ans = ans*rem%MOD;

			int lfixed = ptr_to_left(L);
			int rfixed = ptr_to_right(R);
			if (lfixed != L - 1) {
				assert(rfixed == R + 1);
				add_range(max(lfixed+1, L - c), L);
			} 
			if (rfixed != R + 1) {
				assert(lfixed == L -1);
				add_range(R, min(rfixed -1, R + c));
			}
		} else {
			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);
			}
			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";
	}

}