#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define trace(x) cerr << #x << ": " << x << '\n'
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
template <typename T>
using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--)
    {
        o_set<int> st, st2, tst, tst2;
        int n;
        cin >> n;
        vector<int> a(n), prec(n);
        map<int, int> cnt, cnt2;
        f(i, n)
        {
            cin >> a[i];
            cnt[a[i]]++;
            tst.insert(a[i]);
            st.insert(a[i]);
        }
        f(i, n)
        {
            int s1 = st2.order_of_key(a[i]);
            st.erase(st.find(a[i]));
            cnt[a[i]]--;
            ll ts1 = i - (tst2.order_of_key(a[i]) - cnt2[a[i]]);
            tst2.insert(a[i]);
            tst.erase(tst.find(a[i]));
            ll tx = tst.order_of_key(a[i]);
            int x = (n - i - 1) - st.order_of_key(a[i]) + cnt[a[i]];
            s1 *= x;
            ts1 *= tx;
            prec[i + 1] = s1 + ts1;
            st2.insert(a[i]);
            // cout << ts1 << ' ' << tx << endl;
        }
        int q;
        cin >> q;
        while (q--)
        {
            int m;
            cin >> m;
            cout << prec[m] << '\n';
        }
    }

    return 0;
}