#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n,K;

const int B = 317;
inline int from(int x){
	return x / B + 1;
}
inline int L(int x){
	return x * B - B;
}
inline int R(int x){
	return min(x * B,n);
}
int a[100005],tag[350],ans[100005],ret[100005];
void psh(int p){
	if(tag[p] == -1) return;
	rep(i,L(p),R(p)) a[i] = tag[p];
	tag[p] = -1;
}
void rebuild(int p){
	per(i,R(p),L(p)){
		if(a[i] <= R(p)){
			ans[i] = ans[a[i]];
			ret[i] = ret[a[i]] + 1;
		}else{
			ans[i] = a[i];
			ret[i] = 1;
		}
	}
}
void modify(int l,int r,int val){
	if(l > r) return;
//	printf("modify [%d,%d] %d\n",l,r,val);
	int fl = from(l),fr = from(r);
	if(fl == fr){
		psh(fl);
		rep(k,l,r) a[k] = val;
		rebuild(fl);
		return;
	}
	psh(fr);
	rep(k,L(fr),r) a[k] = val;
	rebuild(fr);

	psh(fl);
	rep(k,l,R(fl)) a[k] = val;
	rebuild(fl);	

	rep(k,fl + 1,fr - 1) tag[k] = val;
}

int Mx;
int query(){
	int pos = 0;
/*	printf("query %d\n",pos);
	rep(i,1,n) printf("%d ",a[i]);
	printf("\n");*/
	int answer = 0;
	while(pos < Mx){
		int fp = from(pos);
		if(tag[fp] != -1){
			answer++;
			pos = tag[fp];
			continue;
		}
		if(ans[pos] < Mx){
			answer += ret[pos];
			pos = ans[pos];			
		}else{
			while(pos < Mx){
				answer++;
				pos = a[pos];
			}
		}
	}
	return answer;
}

set <int> SS;

void solve(){
	SS.clear();
	scanf("%d%d",&n,&K);
	fill(a,a + n + 1,n + 1);
	fill(tag + 1,tag + from(n) + 1,-1);
	Mx = 0;
	int pos;
	rep(i,1,n){
		scanf("%d",&pos);
		chkmax(Mx,pos);
		auto it = SS.lower_bound(pos);
		int pl,pr;
		if(it == SS.end()) pr = inf;
		else pr = *it;
		if(it == SS.begin()) pl = 0;
		else pl = *prev(it);
		SS.insert(pos);

//		printf("pl=%d pr=%d\n",pl,pr);
		rep(k,max(0,pos - K),min(pos - 1,pr - K)){
//			printf("kk=%d ",k);
			modify(k,k,min(n + 1,k + K));
		}
		modify(pl,pos - K,pos);
		printf("%d ",query());
/*		if(i == 2){
			printf("qwqwqwq\n");
			rep(k,0,n) printf("%d ",a[k]);
			printf("\n");
			break;
		}*/
	}
	printf("\n");
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}