#include <algorithm>
#include <array>
#include <iostream>
#include <vector>

using namespace std;

constexpr int N = 1e5 + 1, B = 256;

array<int, 2> jump[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  for (int tc = (cin >> tc, tc); tc--; ) {
    int n, b; cin >> n >> b;
    vector<int> q, u{2 * N}, v;
    for (int i = 0; i < n; i += B) {
      u.insert(u.end(), v.begin(), v.end());
      inplace_merge(u.begin(), u.end() - v.size(), u.end());
      v.clear();
      q.resize(min(n, i + B) - i);
      for (int j = i; j < min(n, i + B); ++j) cin >> q[j - i], v.push_back(q[j - i]);
      v.push_back(2 * N);
      sort(v.begin(), v.end());
      for (int i = n + 1, j = u.size(), k = v.size(); i--; ) {
        j -= j && u[j - 1] > i;
        k -= k && v[k - 1] > i;
        int t = max(u[j], i + b);
        if (k < v.size() && v[k] < t) jump[i] = {-1, t};
        else if (t <= n && ~jump[t][0]) jump[i] = {1 + jump[t][0], jump[t][1]};
        else jump[i] = {1, t};
      }
      v.clear();
      v.push_back(2 * N);
      for (int j = i; j < min(n, i + B); ++j) {
        v.push_back(q[j - i]);
        inplace_merge(v.begin(), v.end() - 1, v.end());
        int ans = -1;
        for (int i = 0, j = 0; i < 2 * N; ) {
          if (i >= n) { ++ans; break; }
          while (j < v.size() && v[j] <= i) ++j;
          if (~jump[i][0]) {
            ans += jump[i][0];
            i = jump[i][1];
          } else ++ans, i = max(i + b, min(v[j], jump[i][1]));
        }
        cout << ans << ' ';
      }
      v.pop_back();
    }
    cout << '\n';
  }
}