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

const int N=200050;

int p[N];
int Find(int x){return p[x]==x?x:p[x]=Find(p[x]);}

int ans[N],a[N];

void SolveBigK(int n,int k){
	for(int i=0;i<=n+1;i++)p[i]=i;
	for(int i=n;i>=1;i--){
		int now=0;
		ans[i]=0;
		while(now<n){
			int x=Find(now+1);
			if(x==n+1)break;
			now=max(x,now+k);
			//printf("%i ",now);
			ans[i]++;
		}
		//printf("\n");
		p[a[i]]=a[i]+1;
	}
}

vector<int> ls,rs;
int tsz,root;
vector<vector<pair<int,int>>> dp;
int b[N],k;

void BuildBlock(int c,int B){
	int l=B*k+1;
	int r=l+k-1;
	if(dp[c].empty()){
		dp[c].resize(2*k);
	}
	//printf("Block (%i %i)\n",l,r);
	for(int st=-k;st<k;st++){
		int now=l+st;
		int fir=Find(max(now+1,l));
		if(fir>r){
			dp[c][st+k]={0,max(-k,now-(r+1))};
		}else{
			now=max(now+k,fir);
			fir=Find(now+1);
			if(fir>r){
				dp[c][st+k]={1,now-(r+1)};
			}else{
				now=max(now+k,fir);
				dp[c][st+k]={2,now-(r+1)};
			}
		}
		//printf("dp[%i] = {%i, %i}\n",st,dp[c][st+k].first,dp[c][st+k].second);
	}
}

void pull(int c){
	if(dp[c].empty()){
		dp[c].resize(2*k);
	}
	//printf("Merge %i %i -> %i\n",ls[c],rs[c],c);
	for(int st=-k;st<k;st++){
		int where=dp[ls[c]][st+k].second;
		dp[c][st+k].first=dp[ls[c]][st+k].first+dp[rs[c]][where+k].first;
		dp[c][st+k].second=dp[rs[c]][where+k].second;
		//printf("dp[%i] = {%i, %i}\n",st,dp[c][st+k].first,dp[c][st+k].second);
	}
}

void Build(int &c,int ss,int se){
	c=++tsz;
	if(ss==se){
		BuildBlock(c,ss);
		return;
	}
	int mid=ss+se>>1;
	Build(ls[c],ss,mid);
	Build(rs[c],mid+1,se);
	pull(c);
}

void Upd(int c,int ss,int se,int qi){
	if(ss==se){
		BuildBlock(c,ss);
		return;
	}
	int mid=ss+se>>1;
	if(qi<=mid)Upd(ls[c],ss,mid,qi);
	else Upd(rs[c],mid+1,se,qi);
	pull(c);
}

void SolveSmallK(int n,int k){
	::k=k;
	for(int i=1;i<=n;i++)b[i]=1;
	for(int i=0;i<=n;i++)p[i]=i;
	for(int i=n+1;i<=n+k;i++)p[i]=i+1;
	p[n+k+1]=n+k+1;

	int mxb=(n-1)/k;
	ls.resize(2*(mxb+1));
	rs.resize(2*(mxb+1));
	dp.resize(2*(mxb+1));
	Build(root,0,mxb);

	for(int i=n;i>=1;i--){
		ans[i]=dp[root][k-1].first;

		p[a[i]]=a[i]+1;
		b[a[i]]=0;
		//printf("Upd %i\n\n",a[i]);
		Upd(root,0,mxb,(a[i]-1)/k);
	}

	ls.clear();
	rs.clear();
	dp.clear();
	root=0;
	tsz=0;
}

int main(){
	int t;
	scanf("%i",&t);
	while(t--){
		int n,k;
		scanf("%i %i",&n,&k);
		for(int i=1;i<=n;i++)scanf("%i",&a[i]);
		if((ll)k*k>=n)SolveBigK(n,k);
		else SolveSmallK(n,k);
		for(int i=1;i<=n;i++)printf("%i ",ans[i]);
		printf("\n");
	}
	return 0;
}