#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<pair<int, int>,null_type,less<pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update>Bohemian;
int main()
{
    Bohemian st;
    int t,cnt=1;
    scanf("%d",&t);
    while(t--)
    {
        int n,q;
        scanf("%d",&n);
        for(int i=0; i<n; i++)
        {
            int a;
            scanf("%d",&a);
            st.insert({i,a});
        }
        int cnt=0;
        while(n--)
        {
            int l;
            scanf("%d",&l);
            auto it = st.find_by_order(l);
            cout<<(*it).second<<endl;
            st.erase(it);
        }
        st.clear();
    }
}