#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        a[i]--;
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
        b[i]--;
    }
    std::vector<int> inva(n), invb(n);
    for (int i = 0; i < n; i++) {
        inva[a[i]] = i;
        invb[b[i]] = i;
    }
    
    std::vector<int> p(n, -1);
    std::vector<int> v{-1};
    
    auto work = [&](auto self, int l1, int l2, int s) -> int {
        assert(a[l1] == b[l2]);
        int x = a[l1];
        p[x] = v.back();
        v.push_back(x);
        if (s == 1) {
            v.pop_back();
            return 1;
        }
        if (a[l1 + 1] == b[l2 + 1]) {
            int t = self(self, l1 + 1, l2 + 1, s - 1);
            if (t < s - 1) {
                t += self(self, l1 + 1 + t, l2 + 1 + t, s - 1 - t);
            }
            v.pop_back();
            return t + 1;
        } else {
            int s1 = inva[b[l2 + 1]] - (l1 + 1);
            int s2 = invb[a[l1 + 1]] - (l2 + 1);
            assert(self(self, l1 + 1, invb[a[l1 + 1]], s1) == s1);
            assert(self(self, inva[b[l2 + 1]], l2 + 1, s2) == s2);
            v.pop_back();
            return 1 + s1 + s2;
        }
    };
    
    work(work, 0, 0, n);
    
    for (int i = 0; i < n; i++) {
        std::cout << p[i] + 1 << " \n"[i == n - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}