#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 1e5 + 5, B = 200;

set <int> all;
int bb[N], bl[N], br[N], nxt[N], nxtb[N], val[N], tag[N];
int a[N], ans[N];
int T, n, k;

void rebuild(int b) {
    for (int i = br[b]; i >= bl[b]; i--) {
        if (nxt[i] > br[b]) nxtb[i] = nxt[i], val[i] = 1;
        else nxtb[i] = nxtb[nxt[i]], val[i] = val[nxt[i]] + 1;
    }
}

void cover(int l, int r, int v) {
    if (bb[l] == bb[r]) {
        for (int i = l; i <= r; i++) nxt[i] = v;
        rebuild(bb[l]);
    } else {
        for (int i = bb[l] + 1; i <= bb[r] - 1; i++) tag[i] = v;
        for (int i = l; i <= br[bb[l]]; i++) nxt[i] = v;
        for (int i = bl[bb[r]]; i <= r; i++) nxt[i] = v;
        rebuild(bb[l]); rebuild(bb[r]);
    }
}

int main() {
    read(T);
    while (T--) {
        read(n); read(k);
        for (int i = 1; i <= n; i++) read(a[i]);
        all.clear(); all.insert(0); all.insert(n + 1);
        nxt[0] = k;
        for (int i = 1; i <= n; i++) {
            bb[i] = (i - 1) / B + 1;
            all.insert(i);
            nxt[i] = i + k;
        }
        for (int i = 1; i <= bb[n]; i++) {
            bl[i] = (i - 1) * B + 1;
            br[i] = min(i * B, n);
            tag[i] = 0;
            rebuild(i);
        }
        for (int i = n; i >= 1; i--) {
            int ans = 1, now = nxt[0], t = *(--(--all.end()));
            while (now < t && bb[now] < bb[t]) {
                if (tag[bb[now]]) {
                    ++ans;
                    now = tag[now];
                } else {
                    ans += val[now];
                    now = nxtb[now];
                }
            }
            if (now < t) {
                if (tag[bb[now]]) ++ans;
                else {
                    while (now < t) {
                        ++ans;
                        now = nxt[now];
                    }
                }
            }
            ::ans[i] = ans;
            if (i != 1) {
                auto it = all.lower_bound(a[i]);
                int L, R;
                ++it; R = *it; --it; --it; L = *it; ++it; all.erase(it);
                int tmp = min(a[i], R - k);
                if (L <= tmp) cover(L, tmp, R);
            }
        }
        for (int i = 1; i <= n; i++) print(ans[i], i == n ? '\n' : ' ');
    }
    return 0;
}