#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define loop(i, l, r) for(int i=(int)(l); i<=(int)(r); i++)
#define rloop(i, l, r) for(int i=(int)(l); i>=(int)(r); i--)
#define all(x) (x).begin(), (x).end()

template<typename T>
ostream &operator<<(ostream &os, vector<T> a) {
  os << "[";
  for (auto it : a)
    os << it << ",";
  os << "]";
  return os;
}

template<typename T, typename T2>
ostream &operator<<(ostream &os, pair<T, T2> a) {
  os << "{";
  os << a.fi << sp << a.se;
  os << "}";
};

const int INF = numeric_limits<int>::max() / 2;

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
#ifdef LOCAL
  freopen("1test.inp", "r", stdin);
#endif
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(m);
  for (auto &it : a)
    cin >> it;
  for (auto &it : b)
    cin >> it;

  vector<int> nxtA(n), nxtB(m);

  auto buildNxt = [](vector<int> &vec, vector<int> &nxt) {
    int lst = INF;
    rloop(i, nxt.size() - 1, 0) {
      if (vec[i] != 0)
        lst = vec[i];
      nxt[i] = lst;
    }
  };
  buildNxt(a, nxtA);
  buildNxt(b, nxtB);

  int L = 0, R = 0;
  loop(val, 1, n + m) {
    if (L < n && a[L] == val) {
      L++;
      continue;
    }
    if (R < m && b[R] == val) {
      R++;
      continue;
    }

    auto cond1 = (L < n && a[L] == 0);
    auto cond2 = (R < m && b[R] == 0);

    if (cond1 && cond2) {
      if (nxtA[L] < nxtB[R]) {
        a[L] = val;
        L++;
      } else {
        b[R] = val;
        R++;
      }
    } else if (cond1) {
      a[L] = val;
      L++;
    } else {
      assert(cond2);
      b[R] = val;
      R++;
    }
  }
  loop(i,0,n-1) cout << a[i] << sp;
  cout << endl;
  loop(i,0,m-1) cout << b[i] << sp;
  cout << endl;
}