#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int N = 5e4 + 5;

int n;
int p[N], k[N];
int arr[N], ans[N];
bitset<N> bst;

int cal(int x) {
    bst.reset();
    for (int i = 1; i <= x; i++)
        bst[k[i]] = 1;
    int it = 0;
    for (int i = 1; i <= n; i++)
        if (bst[i]) {
            if (it == 0 || p[i] > arr[it - 1])
                arr[it++] = p[i];
            else
                *upper_bound(arr, arr + it, p[i]) = p[i];
        }
    return it; 
}

void go(int l, int r) {
    if (l == r - 1)
        return;

    int h = (l + r) / 2;
    ans[h] = cal(h);
    if (ans[l] != ans[h])
        go(l, h);
    if (ans[h] != ans[r])
        go(h, r);
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> p[i];
    for (int i = 1; i <= n; i++)
        cin >> k[i];
    memset(ans, -1, sizeof(ans));

    ans[0] = 0;
    ans[n] = cal(n);
    go(0, n);

    for (int i = 1; i <= n; i++)
        if (ans[i] == -1)
            ans[i] = ans[i - 1];

    for (int i = 1; i <= n; i++)
        cout << ans[i] << " \n"[i == n];
}


int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
}