#include <bits/stdc++.h>
using namespace std;

long long N, A[500000], pos[500000], fw[500001], M = 998244353;
map<pair<long long, long long>, long long> s;

long long q(long long i) {
    long long t = 0;
    while (i) t += fw[i], i -= i & -i;
    return t;
}

void u(long long i, long long v) {
    while (i < N + 1) fw[i] += v, i += i & -i;
}

pair<pair<long long, long long>, long long> con(long long i) {
    auto it = s.upper_bound(make_pair(i, LLONG_MAX));
    if (it == s.begin()) return make_pair(make_pair(-1, -1), -1);
    if ((--it)->first.second < i) return make_pair(make_pair(-1, -1), -1);
    return make_pair(it->first, it->second);
}

void ins(long long l, long long r, long long fl) {
    auto it = s.lower_bound(make_pair(l, 0));
    while (it != s.end() && it->first.first <= r) {
        long long nl = max(l, it->first.first);
        if (!(fl & 1)) nl = min(nl, it->first.first);
        if (!(it->second & 1)) nl = min(nl, l);
        l = nl;
        long long nr = min(r, it->first.second);
        if (!(fl & 2)) nr = max(nr, it->first.second);
        if (!(it->second & 2)) nr = min(nr, r);
        r = nr;
        fl |= it->second;
        it = s.erase(it);
    }
    while (it != s.begin() && (--it)->first.second >= l) {
        long long nl = max(l, it->first.first);
        if (!(fl & 1)) nl = min(nl, it->first.first);
        if (!(it->second & 1)) nl = min(nl, l);
        l = nl;
        long long nr = min(r, it->first.second);
        if (!(fl & 2)) nr = max(nr, it->first.second);
        if (!(it->second & 2)) nr = min(nr, r);
        r = nr;
        fl |= it->second;
        it = s.erase(it);
    }
    s.emplace(make_pair(l, r), fl);
}

int main() {
    //freopen("in.txt", "r", stdin);
    long long T;
    scanf("%lld", &T);
    while (T--) {
        long long C, t = 1, i, j;
        scanf("%lld %lld", &N, &C);
        for (i = 0; i < N; ++i) scanf("%lld", &A[i]), pos[--A[i]] = i;
        for (i = 0; i < N + 1; ++i) fw[i] = 0;
        for (i = 0; i < N; ++i) {
            auto p = con(pos[i]);
            //printf("%lld %lld: (%lld %lld %lld)\n", i, pos[i], p.first.first, p.first.second, p.second);
            if (p.first.first == p.first.second) {
                if (pos[i] - C >= 0) ins(pos[i] - C, pos[i] - 1, 2);
                else ins(pos[i] - 1, pos[i] - 1, 2);
                if (pos[i] + C < N) ins(pos[i] + 1, pos[i] + C, 1);
                else ins(pos[i] + 1, pos[i] + 1, 1);
            } else {
                t *= p.first.second - p.first.first + 1 - q(p.first.second + 1) + q(p.first.first);
                //printf("<%lld | %lld %lld>\n", t, q(p.first.first), q(p.first.second + 1));
                t %= M;
                if (p.first.second - C >= 0) ins(max(p.first.first - C, 0LL), p.first.second, 0);
                if (p.first.first + C < N) ins(p.first.first, min(p.first.second + C, N - 1), 0);
                u(pos[i] + 1, 1);
            }
        }
        printf("%lld\n", t);
        s.clear();
    }
    return 0;
}