#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <queue>

#include <algorithm>

#include <string>

#include <map>

using namespace std;

map <string, int> maps;

int main()

{

    int T;

    cin >> T;

    while(T--)

    {

        int n;

        //char s[11];

        cin >> n;

        maps.clear();

        string s;

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

        {

            cin >> s;

            //maps.insert(pair<string, int>(s, i));

            maps[s] = i;//map把一个s和i对应起来

        }

        int ans = , idx = ;

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

        {

            cin >> s;

            /*map<string, int>::iterator iter;

            iter = maps.find(s);

            int t = iter -> second;*/

            int t = maps[s];

            idx = max(idx, t);

            ans++;

            if(idx == i) printf("%d ", ans), ans = ;

        }

        printf("\n");

    }

    return ;

}