#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb emplace_back
#define fi first
#define se second
using vi=vector<int>;
using pi=pair<int,int>;

template<typename T> bool chmin(T &x,const T &y){
	if(y<x){
		x=y;
		return true;
	}
	return false;
}
template<typename T> bool chmax(T &x,const T &y){
	if(y>x){
		x=y;
		return true;
	}
	return false;
}

const int N=2e5+5, A=1005, B=256, NB=800;

using bs=bitset<N>;

int n, k, a[N];
bs cur, f[NB], g[A];

signed main(){
	ios::sync_with_stdio(0);cin.tie(0);
	
	cin>>n>>k;
	rep(i,1,n){
		cin>>a[i];
	}
	rep(i,1,n){
		cur = cur>>1 & g[a[i]];
		cur[i]=1;
		if(i>1) cur[i-1]=(abs(a[i]-a[i-1])<=k);
		if(i%B==0){
			f[i/B]=cur;
		}
		rep(j, max(1,a[i]-k), min(A-1,a[i]+k)){
			g[j][i]=1;
		}
	}
	rep(i,1,n){
		int le=(i+B-1)/B, ri=n/B;
		int ans=0;
		if(le<=ri){
			while(le<ri){
				int mid=(le+ri+1)/2;
				int r=mid*B, l=i*2-r;
				if(l>0 && f[r/B][l]){
					le=mid;
				}
				else{
					ri=mid-1;
				}
			}
			ans=max(0, le*B-B-i);
		}
		while(i+ans<n && i-ans>1 && abs(a[i+ans+1]-a[i-ans-1])<=k){
			ans++;
		}
		cout<< ans*2+1 <<' ';
	}
	cout<<'\n';
	rep(i,2,n){
		int le=(i+B)/B, ri=n/B;
		int ans=0;
		if(le<=ri){
			while(le<ri){
				int mid=(le+ri+1)/2;
				int r=mid*B, l=i*2-1-r;
				if(l>0 && f[r/B][l]){
					le=mid;
				}
				else{
					ri=mid-1;
				}
			}
			ans=max(0, le*B-B-i);
		}
		// cout<<"?"<<i<<' '<<ans<<endl;
		while(i+ans<=n && i-1-ans>=1 && abs(a[i+ans]-a[i-ans-1])<=k){
			ans++;
		}
		cout<< ans*2 <<' ';
	}
	cout<<'\n';
}