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

const int N = 100100;

int n, k, a[N], pos[N], del[N], ans[N];

int val[N], sum[N], ch[N][2], fa[N];
int type(int x) {
    return x == ch[fa[x]][1];
}
int isrt(int x) {
    return x != ch[fa[x]][0] && x != ch[fa[x]][1];
}
void link(int x, int f, int typ) {
    fa[x] = f;
    ch[f][typ] = x;
}
void up(int x) {
    sum[x] = sum[ch[x][0]] + sum[ch[x][1]] + val[x];
}
void rot(int x) {
    int f = fa[x], g = fa[f], flag = type(x);
    fa[x] = g;
    if (!isrt(f)) ch[g][type(f)] = x;
    link(ch[x][flag ^ 1], f, flag);
    link(f, x, flag ^ 1);
    up(f), up(x);
}
void splay(int x) {
    while (!isrt(x)) {
        int f = fa[x];
        if (isrt(f)) {
            int g = fa[f];
            rot(x);
        } else {
            rot(type(x) == type(f) ? f : x);
            rot(x);
        }
    }
}
void expose(int x) {
    for (int y = 0; x; y = x, x = fa[x])
        splay(x), ch[x][1] = y, up(x);
}
void link(int x, int y) {
    expose(x), splay(x);
    expose(y);
    fa[x] = y;
}
void cut(int x) {
    expose(x), splay(x);
    int y = ch[x][0];
    while (ch[y][1]) y = ch[y][1];
    splay(y);
    assert(ch[y][1] == x);
    ch[y][1] = fa[x] = 0, up(y);
}
void dfs(int x) {
    if (!x) return;
    dfs(ch[x][1]);
    cout << x - 1 << "[" << val[x] << "] ";
    dfs(ch[x][0]);
}

void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i], pos[a[i]] = i;
    deque<int> q;
    for (int i = n; i >= 0; i--) {
        while (!q.empty() && q.back() > i + k) q.pop_back();
        if (q.empty())
            del[i] = n + 1;
        else
            del[i] = pos[q.back()];
        while (!q.empty() && pos[q.front()] >= pos[i]) q.pop_front();
        q.push_front(i);
    }

    for (int i = 1; i <= n + 1; i++) {
        ch[i][0] = ch[i][1] = fa[i] = 0;
        val[i] = sum[i] = 1;
    }
    for (int i = 1; i <= n; i++)
        link(i, min(i + k, n + 1));

    for (int i = n; i >= 1; i--) {
        expose(1), splay(1);
        ans[i] = sum[1] - 1;
        //dfs(1);cout << "\n";
        //cout << i << " " << ans[i] << "\n";

        for (int j = 1; j <= n; j++) if (del[j - 1] == i) {
            //cout << "del " << j - 1 << endl;
            cut(j);
            expose(j), splay(j);
            val[j] = 0, up(j);
            link(j, j + 1);
        }
    }

    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";
    cout << "\n";
}

int main() {
    //freopen("test.in", "r", stdin);
    int t;
    for (cin >> t; t; t--) solve();
}