#include<stdio.h>
#include<algorithm>
constexpr int N{400000},K{1000},L{std::__lg(K)};
int a[N+5];
int f[N+5],g[N+5];
int main() {
    int n,k;
    scanf("%d%d",&n,&k);
    n=(n<<1)-1;
    for(int i=1;i<=n;i+=2) {
        scanf("%d",a+i);
    }
    for(int i=2;i<=n-1;i+=2) {
        a[i]=0;
    }
    for(int i=1,l=0,r=0;i<=n;i++) {
        f[i]=r<i?1:std::min(r-i+1,f[l+r-i]);
        while(i-f[i]>=1&&i+f[i]<=n&&a[i-f[i]]==a[i+f[i]]) {
            ++f[i];
        }
        if(i+f[i]-1>r) {
            l=i-f[i]+1,r=i+f[i]-1;
        }
    }
    for(int d=L-1;d>=0;d--) {
        std::copy(f+1,f+n+1,g+1);
        for(int i=1,l=0,r=0;i<=n;i++) {
            f[i]=r<i?1:std::min(r-i+1,g[l+r-i]);
            while(i-f[i]>=1&&i+f[i]<=n&&std::abs(a[i-f[i]]-a[i+f[i]])<=k>>d) {
                ++f[i];
            }
            if(i+g[i]-1>r) {
                l=i-g[i]+1,r=i+g[i]-1;
            }
        }
    }
    for(int i=1;i<=n;i+=2) {
        printf("%d%c",f[i]-(f[i]&1^1),i==n?'\n':' ');
    }
    for(int i=2;i<=n-1;i+=2) {
        printf("%d%c",f[i]-(f[i]&1),i==n-1?'\n':' ');
    }
    return 0;
}