#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n);
  for (auto& a_i : a) cin >> a_i, --a_i;
  for (auto& b_i : b) cin >> b_i, --b_i;
  vector<int> inv(n);
  REP(i, n) inv[b[i]] = i;
  REP(i, n) cout << a[i] + 1 << " \n"[i + 1 == n];
  REP(_, n) {
    for (int i = 1; i < n;) {
      if (inv[a[i - 1]] > inv[a[i]]) {
        swap(a[i - 1], a[i]);
        i += 2;
      } else {
        ++i;
      }
    }
    REP(i, n) cout << a[i] + 1 << " \n"[i + 1 == n];
  }
  assert(a == b);
  return 0;
}