#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e5 + 10;
int n, B, T, m;
int a[N], f[N], L[N], R[N], pos[N], ans[N], dis[N], nxt[N];
int find(int x) {return f[x] == x ? x : f[x] = find(f[x]);}
void build(int id) {
  for(int i = R[id]; i >= L[id]; i--) {
    int p = min(n, max(i + m, find(i + 1)));
    if(p > R[id])dis[i] = 0, nxt[i] = i;
    else dis[i] = dis[p] + 1, nxt[i] = nxt[p];
    cerr << i << ' ' << p << ' ' << nxt[i] << endl;
  }
  return ;
}
int query() {
  int p = 0, res = 0;
  while(find(p + 1) <= n) {
    res += dis[p]; p = nxt[p];
    if(find(p + 1) <= n)res++, p = min(n, max(p + m, find(p + 1)));
  }
  // cout << res << endl;
  return res;
}
void solve() {
  n = read(); m = read();
  for(int i = 1; i <= n; i++)a[i] = read();
  for(int i = 1; i <= n + 1; i++)f[i] = i;
  B = sqrt(n); T = 0;
  for(int i = 0; i < n; i += B) {
    L[++T] = i; R[T] = min(n - 1, i + B - 1);
    for(int j = L[T]; j <= R[T]; j++)pos[j] = T;
    build(T);
  }
  for(int i = n; i; i--) {
    ans[i] = query();
    f[a[i]] = a[i] + 1;
    build(pos[a[i]]);
  }
  for(int i = 1; i <= n; i++)printf("%d ", ans[i]); putchar('\n');
  return ;
}
int main() {
  int test = read();
  while(test--)solve();
  return 0;
}