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

const int N = 505;

int a[N], b[N];
bool vis[N];
vector<array<int, 4>> vec;
int n, m;

int main() {
    scanf("%d%d", &n, &m);
    int las = 0;
    for (int i = 1; i <= n + 1; i++) {
        if (i <= n) scanf("%d", &a[i]);
        else a[i] = n + m + 1;
        if (a[i]) {
            vis[a[i]] = 1;
            vec.push_back({a[i], 0, las + 1, i - 1});
            las = i;
        }
    }   
    las = 0; 
    for (int i = 1; i <= m + 1; i++) {
        if (i <= m) scanf("%d", &b[i]);
        else b[i] = n + m + 1;
        if (b[i]) {
            vis[b[i]] = 1;
            vec.push_back({b[i], 1, las + 1, i - 1});
            las = i;
        }
    }
    sort(vec.begin(), vec.end());
    int p = 1;
    for (auto it: vec) {
        int val = it[0], type = it[1], l = it[2], r = it[3]; 
        for (int i = l; i <= r; i++) {
            while (vis[p]) p++;
            if (!type) a[i] = p;
            else b[i] = p;
            p++;
        }
    }
    
    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;
}