// #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
int n,k;
class Block{
    public:
        vector<pair<int,int>> ans;
        vector<int> nxt;
        vector<int> mark;
        int n;
        bool exist = 0;
        pair<int,int> startv;
        Block(int _n){
            n = _n;
            exist = 0;
            ans.resize(k + 1);
            nxt.resize(_n);
            mark.resize(_n);
        }
        void calc(){
            for(int i = n - 1; i >= 0; --i){
                if(mark[i])
                    nxt[i] = i;
                else if(i == n - 1)
                    nxt[i] = 1e9;
                else
                    nxt[i] = nxt[i + 1];
            }
            for(int p = 0; p < k; ++p){
                int st = p,cnt = 0,flag = 0;
                while(1){
                    if(st == n-1 || nxt[st + 1] == 1e9){
                        ans[p] = make_pair(cnt,st);
                        break;
                    }
                    if(st + k >= n){
                        ans[p] = make_pair(cnt + 1,st + k);
                        break;
                    }
                    if(nxt[st + k] == nxt[st + 1]){
                        st = nxt[st + 1];
                    }
                    else{
                        st = st + k;
                    }
                    ++cnt;
                }
            }
            int p = nxt[0];
              int st = p,cnt = 0,flag = 0;
                while(1){
                    if(st == n-1 || nxt[st + 1] == 1e9){
                        startv = make_pair(cnt,st);
                        break;
                    }
                    if(st + k >= n){
                        startv = make_pair(cnt + 1,st + k);
                        break;
                    }
                    if(nxt[st + k] == nxt[st + 1]){
                        st = nxt[st + 1];
                    }
                    else{
                        st = st + k;
                    }
                    ++cnt;
                }
        }
        void add(int x){
            exist = 1;
            if(mark[x])
                return;
            mark[x] = 1;
            calc();
        }
        pair<int,int> getAns(int st){
            if(st == nxt[0]){
                return startv;
            }
            return ans[st];
        }
        bool Exist(){
            return exist;
        }
};
signed main()
{
    #ifdef NICEGUODONG
        freopen("data.in","r",stdin);
        freopen("wa.out","w",stdout);
    #endif
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while(T--){
        cin >> n >> k;
        int len;
        if(1 || k * k >= n || n <= 3){
            set<int> S;
            int v = 0;
            for(int i = 1; i <= n; ++i){
                int x;
                cin >> x;
                S.insert(x);
                int cnt = 0;
                while(1){
                    auto it = S.upper_bound(v);
                    if(it == S.end()){
                        cout << cnt << '\n';
                        break;
                    }
                    v = max(v + k,*it);
                }
            }
            len = n;
            continue;
        }
        else{
            len = sqrt(n) + k + 1;
        }
        // len = n + 1;
        vector<Block> block((n + len - 1) / len + 1, Block(len));
        int maxx = 0;

        for(int i = 1; i <= n; ++i){
            int x;
            cin >> x;
            maxx = max(maxx,x);
            block[x / len].add(x % len);
            int cur = 0,ans = 0,id = 0,ext = 0;
            while(cur < maxx){
                int l = id * len;
                if(block[id].exist == 0){
                    ++id;
                    ext = 1;
                    continue;
                }
                if(ext == 1){
                    ext = 0;
                    ans++;
                    cur = block[id].nxt[0] + l;
                }
                if(cur >= l){
                    auto [fee,nxt] = block[id].getAns(cur - l);
                    ans += fee;
                    cur = nxt + l;
                }
                else{
                    cur = max(cur + k,block[id].nxt[0] + l);
                    ++ans;
                    auto t = block[id].getAns(cur - l);
                    auto &[fee,nxt] = t;
                    ans += fee;
                    cur = nxt + l;
                }
                ++id;
            }
            cout << ans << " ";
        }
        cout << '\n';
    }

}