#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
using ll = long long;
using i128 = __int128;
using db = double;
using ld = long double;
#define int ll
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

const int INF=LLONG_MAX/4;
const int MOD=998244353;

random_device rd;
mt19937_64 gen(rd());

void pre_do(){

}

void solve(){	

	int n; cin >> n;
	vector<vector<int>> ans(n+1, vector<int>(n, 0));
	vector<int> pos(n+1);
	for(int i=0;i<n;i++){
		cin >> ans[0][i];
	}
	for(int i=0;i<n;i++){
		cin >> ans[n][i];
		pos[ans[n][i]] = i;
	}

	vector<int> cur = ans[0];
	for(int i=1;i<n;i++){
		for(int j=0;j+1<n;j++){
			if(pos[cur[j]]>pos[cur[j+1]]){
				swap(cur[j], cur[j+1]);
				j++;
			}
		}
		ans[i] = cur;
	}
	for(int i=0;i<=n;i++){
		for(int j=0;j<n;j++) cout << ans[i][j] << ' ';
		cout << '\n';
	}
	
}
 	
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	pre_do();

	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
	//cout << "FINISH\n";
}