#include<bits/stdc++.h>
namespace rgs = std::ranges;
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = double;
const int N = 50005;
const int M = sqrt(N) * 2 + 100;
int p[N], k[N], t[N];
int n;
struct bit {
	int bit[N];
	void add(int p, int v) {
		for(;p <= n;p += p & -p) {
			bit[p] = std::min(bit[p], v);
		}
	}
	int qry(int p) {
		int ans = 1e9;
		for(;p;p &= p - 1) {
			ans = std::min(ans, bit[p]);
		}
		return ans;
	}
	void init() {
		std::fill(bit + 1, bit + n + 1, 1e9);
	}
} bit[M];
int dp[N][M];
int ans[N];
void solve() {
	cin >> n;
	for(int i = 1;i <= n;++i) {
		cin >> p[i];
	}
	for(int i = 1;i <= n;++i) {
		cin >> k[i];
		t[k[i]] = i;
	}
	for(int i = 0;i < M;++i) bit[i].init();
	for(int i = 0;i < M;++i) {
		dp[0][i] = i ? n + 1 : 0;
		bit[i].add(1, dp[0][i]);
	}
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j < M;++j) {
			dp[i][j] = std::max(t[i], bit[j - 1].qry(p[i]));
		}
		for(int j = 1;j < M;++j) {
			bit[j].add(p[i], dp[i][j]);
		}
	}
	for(int i = 1, la = 1;i < M;++i) {
		int lim = bit[i].qry(n);
		for(;la < lim;++la) {
			ans[la] = i - 1;
		}
	}
	for(int i = 1;i <= n;++i) {
		cout << ans[i] << " \n"[i == n];
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 0;i < T;++i) {
		solve();
	}
}