#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5, M = 1005;

typedef bitset<N> BS;

int n, m = 1000, k;
int a[N];
BS p[M], q[M], f, g;
int r[N * 2];

int main()
{
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]), p[a[i]].set(i);
    for(int i = 1; i <= m; i ++ ) p[i] ^= p[i - 1];
    for(int i = 1; i <= m; i ++ ) q[i] = p[min(i + k, m)] ^ p[max(i - k - 1, 0)];

    f.set(1);
    for(int i = 2; i <= n + 1; i ++ )
    {
        f >>= 1;
        g = f & ~q[a[i]];
        for(int j = g._Find_first(); j < i; j = g._Find_next(j))
        {
            // printf("#%d %d\n", i, j);
            r[i + j] = i - j - 1;
        }
        f &= q[a[i]];
        f[i] = 1, f[i - 1] = abs(a[i] - a[i - 1]) <= k;
        // for(int i = 1; i <= n; i ++ ) printf("%d", (int)f[i]);
        // puts("");
    }

    for(int i = 2; i <= n * 2; i += 2) printf("%d ", r[i]);
    puts("");
    for(int i = 3; i <= n * 2; i += 2) printf("%d ", r[i]);
    puts("");
    return 0;
}