#include <bits/stdc++.h>
using namespace std;
const int N = 50010;
int n, a[N], b[N], f[N], vis[N];
inline void Solve(int l, int r) {
    if (f[l - 1] == f[r + 1]) {
        for (int i = l; i <= r; ++i) f[i] = f[l - 1];
        return;
    }
    int m = (l + r) >> 1;
    for (int i = 1; i <= m; ++i) vis[b[i]] = 1;
    vector<int> h(1, 0);
    for (int i = 1; i <= n; ++i) if (vis[i]) {
        int fi = lower_bound(h.begin(), h.end(), a[i]) - h.begin();
        if (fi == h.size()) h.push_back(a[i]);
        else h[fi] = a[i];
    }
    f[m] = h.size() - 1;
    for (int i = 1; i <= m; ++i) vis[b[i]] = 0;
    if (l < m) Solve(l, m - 1);
    if (m < r) Solve(m + 1, r);
}
int main() {
    int Case;
    scanf("%d", &Case);
    while (Case--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", a + i);
        for (int i = 1; i <= n; ++i) scanf("%d", b + i);
        f[0] = 0; f[n + 1] = n + 1;
        Solve(1, n);
        for (int i = 1; i <= n; ++i) printf("%d ", f[i]);
        puts("");
    }
    return 0;
}