#include <bits/stdc++.h>

#define maxn 100005

using namespace std;

int n, m;
int a[maxn];
int b[maxn];

int fx, fy;

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
	a[n + 1] = n + m + 1;
	b[m + 1] = n + m + 2;
	++n, ++m;
	fx = fy = 1;
	for (int x = 1; x <= n + m; x++) {
		if (a[fx] == x) ++fx;
		else if (b[fy] == x) ++fy;
		else {
			int l1, i1;
			for (int i = fx; i <= n; i++) {
				if (a[i]) {
					l1 = a[i];
					i1 = i;
					break;
				}
			}
			int l2, i2;
			for (int i = fy; i <= m; i++) {
				if (b[i]) {
					l2 = b[i];
					i2 = i;
					break;
				}
			}
//			cout<<l1<<" "<<i1<<" "<<l2<<" "<<i2<<endl;
			if (l1 < l2) {
				if (i1 - fx == l1 - x) a[fx++] = x;
				else b[fy++] = x;
			}
			else {
				if (i2 - fy == l2 - x) b[fy++] = x;
				else a[fx++] = x;
			}
		}
	}
	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;
}