#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define F first
#define S second
#define int long long


const int lar=3e18;
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n,m;
    cin>>n>>m;

    int a[n+5],b[m+5];int vis[n+m+5]={0};
    for(int i=1;i<=n;i++) cin>>a[i],vis[a[i]]=1;
    for(int i=1;i<=m;i++) cin>>b[i],vis[b[i]]=1;

    a[n+1]=lar;
    b[m+1]=lar;

    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>now;
    for(int i=1;i<=n+1;i++){
        if(a[i]) {
            now.push({a[i],i});
            break;
        }
    }

    for(int i=1;i<=m+1;i++){
        if(b[i]){
            now.push({b[i],i+n+1});
            break;
        }
    }

    int p=1;
    int u1=1,u2=1;
    while(now.size()){
        auto t=now.top();
        now.pop();
        // cerr<<t.S<<"\n";
        int id=t.S;
        if(t.S>n+1){
            id-=n+1;
            for(int i=u2;i<id;i++){
                while(vis[p]) p++;
                b[i]=p,p++;
            }
            // cerr<<b[id]<<" "<<p<<"\n";
            while(p<b[id]&&id!=m+1){
                while(vis[p]) p++;
                if(p>=b[id]) break;
                a[u1]=p,p++,u1++;
            }
            if(now.size()&&u1==now.top().S){
                u1++;
                now.pop();
                for(int i=u1;i<=n+1;i++){
                    if(a[i]){
                        now.push({a[i],i});
                        break;
                    }
                }
            }
            u2=id+1;
            // cerr<<id<<"\n";
            for(int i=id+1;i<=m+1;i++){
                // cerr<<b[i]<<"b[i]\n";
                if(b[i]) {now.push({b[i],i+n+1});break;}
                
            }
        }
        else{
            for(int i=u1;i<id;i++){
                while(vis[p]) p++;
                a[i]=p,p++;
            }
            while(p<a[id]&&id!=n+1){
                // cerr<<p<<" "<<id<<" "<<a[id]<<"\n";
                while(vis[p]) p++;
                if(p>=a[id]) break;
                b[u2]=p;
                p++;
                u2++;
            }
            if(now.size()&&u2==now.top().S-n-1){
                u2++;
                now.pop();
                for(int i=u2;i<=m+1;i++){
                    if(b[i]){
                        now.push({b[i],i+n+1});
                        break;
                    }
                }
            }
            u1=id+1;
            for(int i=id+1;i<=n+1;i++){
                if(a[i]) {now.push({a[i],i});break;}
                // break;
            }
        }
    }

    for(int i=1;i<=n;i++) cout<<a[i]<<" ";cout<<"\n";
    for(int i=1;i<=m;i++) cout<<b[i]<<" ";cout<<"\n";
}