#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
int sign(int a){ return (a&1) ? (Mod-1) : 1; }
void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n, k, a[100100];

const int B = 316;
//const int B = 11;

int nxt[100100], nxtcnt[100100], to[100100], tag[100100];

void pushdown(int bi){
	if(tag[bi] < 0) return ;
	for(int i = bi*B; i < min(n+1, (bi+1)*B); ++i)
		to[i] = tag[bi];
	tag[bi] = -1;
}

void rebuild(int bi){
	for(int i = min((bi+1)*B - 1, n); i >= bi; --i){
		int t = min(max(to[i], i + k), n);
		if(t / B == i / B)
			nxt[i] = nxt[t], nxtcnt[i] = nxtcnt[t] + 1;
		else
			nxt[i] = t, nxtcnt[i] = 1;
	}
}

void upd(int tl, int tr, int v){
	int bl = tl / B, br = tr / B;
	if(bl == br){
		pushdown(bl);
		for(int i = tl; i <= tr; ++i) to[i] = v;
		rebuild(bl);
	} else {
		pushdown(bl);
		for(int i = tl; i < (bl+1) * B; ++i) to[i] = v;
		rebuild(bl);
		pushdown(br);
		for(int i = br*B; i <= tr; ++i) to[i] = v;
		rebuild(br);
		for(int i = bl+1; i < br; ++i) tag[i] = v;
	}
}

int mx = -1;
int calc(){
	int p = 0, ret = 0;
	while(p < mx){
		if(p / B == mx / B){
			pushdown(p / B);
			while(p < mx)
				p = max(to[p], p + k), ++ret;
			break;
		} else {
			ret += nxtcnt[p], p = nxt[p];
		}
	}
	return ret;
}

void solve(){
	cin >> n >> k;
	rep(i, n) cin >> a[i];
	rep(i, n+1) to[i] = -1;
	for(int i = n/B; i >= 0; --i) tag[i] = -1, rebuild(i);
	rep(i, n / B + 1) tag[i] = -1;
	mx = -1;
	set<int> st;
	st.insert(0);
	rep(i, n){
		mx = max(mx, a[i]);
		int pre = *prev(st.lower_bound(a[i]));
		st.insert(a[i]);
		upd(pre, a[i]-1, a[i]);
		cout << calc() << " ";
	}
	cout << "\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T--) solve();

	return 0;
}