#include <bits/stdc++.h>
#define sz(x) signed(size(x))
using namespace std;
using ll = long long;
using LL = long long;

inline void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> a(n), b(m), in(n + m + 1);
    for (int& i : a) {
        cin >> i;
        in[i] = 1;
    }
    for (int& i : b) {
        cin >> i;
        in[i] = 1;
    }

    auto dfs = [&](auto& self, int i, int j, int cnt) -> bool {
        if (i == n && j == m)
            return 1;

        if (i && a[i] != 0 && a[i] < a[i - 1]) return 0;
        if (j && b[j] != 0 && b[j] < b[j - 1]) return 0;

        while (in[cnt]) ++cnt;
        if (i < n && a[i] == 0) {
            a[i] = cnt;
            if (self(self, i + 1, j, cnt + 1))
                return 1;
            a[i] = 0;
        }
        if (j < m && b[j] == 0) {
            b[j] = cnt;
            if(self(self, i, j + 1, cnt + 1))
                return 1;
            b[j] = 0;
        }

        if ((i < n && a[i] == 0) || (i < m && b[j] == 0)) return 0;
        return self(self, i + (i < n), j + (j < m), cnt);
    };

    dfs(dfs, 0, 0, 1);
    for (int i : a)
        cout << i << ' ';
    cout << '\n';
    for (int i : b)
        cout << i << ' ';
    cout << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}