#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool mk[200000005];
int t;
ll n,d;
int judge1(int mid){
    int mn=1000000000;
    for(int i=mid-d;i<=mid+d;i++){
        if(mk[i]){
            mn=min(mn,abs(mid-i));
        }
    }
    if(mn!=1000000000){
        return mn;
    }
    return -2147483648;
}
int main(){
    freopen("airport.in","r",stdin);
    freopen("airport.out","w",stdout);
    cin>>t;
    while(t--){
        ll res=0;
        cin>>n>>d;
        memset(mk,0,sizeof(mk));
        for(int i=1;i<=n;i++){
            ll a;
            cin>>a;
            if(i==1){
                mk[a]=1;
                cout<<0<<" ";
            }
            else{
                int near=judge1(a);
                if(near==-2147483648){
                    mk[a]=1;
                    cout<<"0 ";
                    continue;
                } 
                else{
                    mk[near+d]=1;
                    cout<<near+d-a<<" ";
                }
            }
        }
    }
    return 0;
}