#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
using namespace std;
typedef pair<int,int> pi;
int n,m;
int a[105],b[105];
int d[105][105];
int p[105][105];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= m;i++) cin >> b[i];
    d[0][0] = 1;
    for(int i = 0;i <= n;i++) {
        for(int j = 0;j <= m;j++) {
            int nx = i+j+1;
            if(a[i+1] == nx) {
                if(d[i][j]) p[i+1][j] = 0;
                d[i+1][j] |= d[i][j];
                
            }
            else if(b[j+1] == nx) {
                if(d[i][j]) p[i][j+1] = 1;
                d[i][j+1] |= d[i][j];
            }
            else {
                if(!a[i+1]) {
                    if(d[i][j]) p[i+1][j] = 0;
                    d[i+1][j] |= d[i][j];
                }
                if(!b[j+1]) {
                    if(d[i][j]) p[i][j+1] = 1;
                    d[i][j+1] |= d[i][j];
                }
            }
            
        }
        
    }
    
    for(int i = n,j = m;i+j;) {
        int nx = i+j;
        if(!p[i][j]) a[i--] = nx;
        else b[j--] = nx;
    }
    for(int i = 1;i <= n;i++) cout << a[i] << ' ';
    cout << '\n';
    for(int j = 1;j <= m;j++) cout << b[j] << ' ';
    return 0;
}