#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back

using namespace std;

void add(int num, int &pa, vector<int> &v, vector<int> &pre) {
    v[pa ++] = num;
    if(!v[pa]) { pre[pa] = num; return ; }
    while(pa < v.size() - 1 && v[pa]) ++ pa;
}

int main() {
//    if(fopen("yl.in", "r")) {
//        freopen("yl.in", "r", stdin);
//        freopen("yl.out", "w", stdout);
//    }
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1), b(m + 1), prea(n + 1), suba(n + 1), preb(m + 1), subb(m + 1), exi(n + m + 1);
    rep(i,1,n) {
        cin >> a[i];
        prea[i] = max(prea[i - 1], a[i]);
        if(a[i]) exi[a[i]] = 1;
    }
    rep(i,1,m) {
        cin >> b[i];
        preb[i] = max(preb[i - 1], b[i]);
        if(b[i]) exi[b[i]] = 1;
    }
    subb[m] = b[m] == 0 ? m * 2 + 1 : b[m];
    suba[n] = a[n] == 0 ? n * 2 + 1 : a[n];
    per(i,n - 1,1) suba[i] = a[i] ? a[i] : suba[i + 1];
    per(i,m - 1,1) subb[i] = b[i] ? b[i] : subb[i + 1];
    int pa = 1, pb = 1;
    while(pa != n && a[pa]) ++ pa;
    while(pb != m && b[pb]) ++ pb;
    vector<int> lft;
//    rep(i,1,n + m) cerr << exi[i] << ' '; cerr << endl;
//	rep(i,1,n) cout << a[i] << ' '; cout << endl;
//	rep(i,1,m) cout << b[i] << ' '; cout << endl;
    rep(i,1,n + m) if(!exi[i]) lft.pb(i);
//    cerr << lft.size() << endl;
//    for(int i : lft) cerr << i << ' '; cout << endl;
//	rep(i,1,n) cout << suba[i] << ' '; cout << endl;
//	rep(i,1,m) cout << subb[i] << ' '; cout << endl;
    for(auto &it : lft) {
//        cerr << it << endl;
//		cout << it << endl;
        if(pa > n || it < prea[pa] || it > suba[pa]) add(it, pb, b, preb);
        else if(pb > m || it < preb[pb] || it > subb[pb]) add(it, pa, a, prea);
        else if(suba[pa] < subb[pb]) add(it, pa, a, prea);
        else add(it, pb, b, preb);
    }
//    cerr << "qwq" << endl;
    rep(i,1,n) cout << a[i] << ' '; cout << endl;
    rep(i,1,m) cout << b[i] << ' '; cout << endl;
//    cerr << "qwq" << endl;
	return 0;
}