#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n;
	cin >> n;
	vector<int> a(n), b(n);
	rep(i, 0, n) cin >> a[i], a[i]--;
	rep(i, 0, n) cin >> b[i], b[i]--;
	vector<int> p(n);
	rep(i, 0, n) p[b[i]] = i;

	rep(i, 0, n) cout << a[i] + 1 << ' ';
	cout << '\n';
	rep(lp, 0, n) {
		rep(i, 0, n - 1) {
			if (p[a[i]] > p[a[i + 1]]) {
				swap(a[i], a[i + 1]);
				i++;
			}
		}
		rep(i, 0, n) cout << a[i] + 1 << ' ';
		cout << '\n';
	}
	return;

	vector<vector<int>> ans(n, vector<int>(n, 0));

	rep(i, 0, n) ans[i][n - 1 - i] = 1;
	rep(i, 0, n - 1) ans[i + 1][n - 1 - i] = 1;

	rep(i, 0, n) {
		rep(j, 0, n) cout << (ans[i][j] ? '#' : '.');
		cout << '\n';
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}