#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++)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<int> a(n), prec(n + 1);
        o_set<int> st, st2;
        map<int, int> cnt;

        f(i, n) {
            cin >> a[i];
            cnt[a[i]]++;
            st.insert(a[i]);
        }

        for (int i = 0; i < n; i++) {
            int s1 = st2.order_of_key(a[i]);
            st.erase(st.find(a[i]));
            cnt[a[i]]--;

            ll ts1 = i - (st2.order_of_key(a[i]) - cnt[a[i]]);
            st2.insert(a[i]);

            ll tx = st.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;
        }

        int q;
        cin >> q;
        while (q--) {
            int m;
            cin >> m;
            if (m <= n)
                cout << prec[m] << '\n';
            else
                cout << 0 << '\n';
        }
    }

    return 0;
}