#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5, V = 1005;

bitset<N> f[2005], g[V];
int a[N];

signed main() {
    int n, m; scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        for (int j = max(a[i] - m, 1); j <= min(a[i] + m, 1000); ++j) g[j][i] = 1;
    }
    bitset<N> now, tf;
    for (int i = 1; i <= n; ++i) {
        now = 1;
        tf = (tf >> 1) & g[a[i]];
        tf[i] = 1;
        if (i && abs(a[i] - a[i - 1]) <= m) tf[i - 1] = 1;
        tf &= now;
        if (i % 1000 == 0) f[i / 1000] = tf;
    }
    auto check = [&](int l, int r) {
        int p = r / 1000 * 1000;
        ++p;
        if (p * 1000 > n) return 0;
        return (int)f[p][l - (p * 1000 - r)];
    };
    for (int i = 1; i <= n; ++i) {
        int L = 1, R = min(i - 1, n - i), res = 0;
        while (L <= R) {
            int mid = (L + R) >> 1;
            if (check(i - mid, i + mid)) res = mid, L = mid + 1;
            else R = mid - 1;
        }
        while (res < min(i - 1, n - i) && abs(a[i + res] - a[i - res]) <= m) ++res;
        printf("%d%c", res * 2 + 1, " \n"[i == n]);
    }
    for (int i = 1; i < n; ++i) {
        int L = 1, R = min(i, n - i), res = 0;
        while (L <= R) {
            int mid = (L + R) >> 1;
            if (check(i - mid + 1, i + mid)) res = mid, L = mid + 1;
            else R = mid - 1;
        }
        while (res < min(i, n - i) && abs(a[i + res + 1] - a[i - res]) <= m) ++res;
        printf("%d%c", res * 2, " \n"[i == n - 1]);
    }
    return 0;
}