#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e5 + 5;
int n, a1[N], a2[N], p1[N], p2[N], faz[N];
vector<int> st;
int dfs(int l1, int l2, int lim) {
	assert(a1[l1] == a2[l2]);
	int rt = a1[l1];
	faz[rt] = st.back(), st.push_back(rt);
	if (lim == 1) {
		st.pop_back();
		return 1;
	}
	if (a1[l1 + 1] == a2[l2 + 1]) {
		int x = dfs(l1 + 1, l2 + 1, lim - 1);
		if (lim - 1 > x) {
			x += dfs(l1 + 1 + x, l2 + 1 + x, lim - 1 - x);
		}
		st.pop_back();
		return x + 1;
	} else {
		int x = p1[a2[l2 + 1]] - (l1 + 1);
		int y = p2[a1[l1 + 1]] - (l2 + 1);
		dfs(l1 + 1, p2[a1[l1 + 1]], x);
		dfs(p1[a2[l2 + 1]], l2 + 1, y);
		st.pop_back();
		return x + y + 1;
	}
}
void solve() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a1[i];
		p1[a1[i]] = i;
	}
	for (int i = 1; i <= n; i++) {
		cin >> a2[i];
		p2[a2[i]] = i;
	}
	st = {0};
	dfs(1, 1, n);
	for (int i = 1; i <= n; i++) {
		cout << faz[i] << " \n"[i == n];
	}
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}