#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
int read(){
    char ch=getchar();int x=0,f=1;
    for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
    for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
    return f*x;
}
const int N=100100;
int a[N],b[N];
int qa[N],qb[N],t1=0,t2=0;
bool bo[N]={};
int main(){
    n=read();m=read();
    for(int i=1;i<=n;i++)a[i]=read(),bo[a[i]]=1;
    for(int i=1;i<=m;i++)b[i]=read(),bo[b[i]]=1;
    a[0]=b[0]=0;
    a[n+1]=b[m+1]=n+m+1;
    a[n+2]=b[m+2]=(1<<30);
    for(int i=0;i<=n+2;i++)if(a[i])qa[++t1]=i;
    for(int i=0;i<=m+2;i++)if(b[i])qb[++t2]=i;
    int i=0,j=0;
    for(;;){
        int x=qa[i],y=qa[i+1];
        int u=qb[j],v=qb[j+1];
        if(a[y]<b[v]){
            int now=x+1;
            for(int k=1;k<=n+m;k++){
                if(now==y)break;
                if(!bo[k]&&k>=a[x]){
                    bo[k]=1;
                    a[now++]=k;
                }
            }
            i++;
        }else{
            int now=u+1;
            for(int k=1;k<=n+m;k++){
                if(now==v)break;
                if(!bo[k]&&k>=b[u]){
                    bo[k]=1;
                    b[now++]=k;
                }
            }
            j++;
        }
        if(i==t1-1&&j==t2-1)break;
    }
    for(int i=1;i<=n;i++)printf("%d ",a[i]);
    puts("");
    for(int i=1;i<=m;i++)printf("%d ",b[i]);
    puts("");
    return 0;
}
/*
7 8
0 5 0 0 0 13 0
0 0 3 0 8 0 12 0
*/