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

#ifdef DEBUG
#define fast
#else
#define fast cin.tie(0)->sync_with_stdio(0)
#define cerr if(1);else cerr
#define endl '\n'
#endif
#define _ <<' '<<
#define ALL(v) v.begin(),v.end()
#define ft first
#define sd second

using ll = long long;
using ld = long double;
using pii = pair<int,int>;

signed main() {
    fast;

    int n, m;
    cin >> n >> m;
    vector<int> arr(n), brr(m), used(n+m+1, false);
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        used[arr[i]] = true;
    }
    for (int i = 0; i < m; ++i) {
        cin >> brr[i];
        used[brr[i]] = true;
    }

    int i = 0, j = 0, k = 1;
    while (i < n || j < m) {
        while(i < n && arr[i] != 0) ++i;
        while(j < m && brr[j] != 0) ++j;
        if (i >= n && j >= m) break;
        while(k <= n + m && used[k]) ++k;

        int ii = 0, jj = 0;
        for (int p = i; p < n; ++p) if (arr[p] && !ii) ii = arr[p];
        for (int p = j; p < m; ++p) if (brr[p] && !jj) jj = brr[p];

        int li = 0, lj = 0;
        if (i) li = arr[i-1];
        if (j) lj = brr[j-1];

        //cout << k _ li << ' ' << lj << ' ' << ii << ' ' << jj << endl;

        if (li < k && lj < k) {
            if (ii < jj) arr[i++] = k++;
            else brr[j++] = k++;
        } else if (li < k) {
            arr[i++] = k++;
        } else {
            brr[j++] = k++;
        }
    }
    
    for (int &x : arr) cout << x << ' ';
    cout << '\n';
    for (int &x : brr) cout << x << ' ';
    cout << '\n';

    cerr _ "meow" _ endl;

    return 0;
}