#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<algorithm>

 #include<queue>

 using namespace std;

 const int maxn = 5e4 + ;

 int a[maxn], vis[maxn], ans[maxn], d[maxn], in[maxn], dp[maxn];

 int len;

 void  slove(int n) {

     len = ;

     for (int i = ; i <= n; i++) {

         if (a[i] != ) {

             int pos = lower_bound(d + , d +  + len, a[i]) - d;

             if (pos > len)

                 d[++len] = a[i];

             else

                 d[pos] = a[i];

             dp[i] = pos;

         }

     }

     int q = len, limit = n;

     for (int i = n; i >= ; i--) {

         if (dp[i] == q && a[i] <= limit && a[i] != ) {

             limit = a[i];

             in[i] = ;

             q--;

         }

         else

             in[i] = ;

     }

 }

 int main() {

     int t;

     scanf("%d", &t);

     while (t--) {

         int n;

         scanf("%d", &n);

         for (int i = ; i <= n; i++)

             scanf("%d", &a[i]);

         for (int i = ; i <= n; i++)

             scanf("%d", &vis[i]);

         slove(n);

         for (int i = n; i >= ; i--) {

             ans[i] = len;

             a[vis[i]] = ;

             if (in[vis[i]])slove(n);

         }

         for (int i = ; i <= n; i++)

             printf("%d%c", ans[i], i == n ? '\n' : ' ');

     }

 }