#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}
const int mod=998244353;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,int y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}

const int V=1e3;
int n,k,a[200002],cov[400002];

bitset<400002> bt,cons[1002];
void work(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=V;i++)cons[i][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=a[i]+k+1;j<=V;j++)cons[j][i]=1;
        for(int j=a[i]-k-1;j>=1;j--)cons[j][i]=1;
        auto FREE=(cons[a[i]]<<i)&~bt;
        for(int j=FREE._Find_first();j<=2*n;j=FREE._Find_next(j)){
            bt[j]=1;
            cov[j]=i;
        }
    }

    for(int i=2;i<=2*n;i++){
        if(!bt[i]){
            cov[i]=n+1;
        }
    }
    for(int i=2;i<=2*n;i+=2){
        cout<<2*cov[i]-i-1<<' ';
    }
    cout<<'\n';
    for(int i=3;i<=2*n;i+=2){
        cout<<2*cov[i]-i+1-2<<' ';
    }
    cout<<'\n';

}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/