//#pragma once
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>

//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;

// Author: Mohamed Bakr

#define ll long long
#define INT int32_t
#define int ll
#define vct vector
//#define int128 number<cpp_int_backend<128, 128, unsigned_magnitude, unchecked, void>>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sum(v) accumulate(all(v), 0LL)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define ln "\n"
#define lln cout<<ln
#define umap unordered_map
#define yes cout<<"YES"<<ln
#define no cout<<"NO"<<ln
#define precision(x,y) fixed<<setprecision(y)<<x
#define fastio ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define dbg(ele) cout << #ele <<" : "<< ele << '\n'
#define PI 3.141592653589793238462643383279502884197
#define toDeg(theta) theta*(180.0/PI)
#define toRad(theta) theta*(PI/180.0)

template <typename T, typename C>
istream& operator>>(istream& istream, pair<T, C>& pi) { cin >> pi.first >> pi.second; return istream; }
template <typename T, typename C>
ostream& operator<<(ostream& ostream, pair<T, C>& pi) { cout << pi.first << " " << pi.second;  return ostream; }
template <typename T>
istream& operator>>(istream& istream, vector<T>& v) { for (T& it : v) cin >> it; return istream; }
template <typename T>
ostream& operator<<(ostream& ostream, vector<T>& v) { for (T it : v) cout << it << " "; return ostream; }
template <typename T>
ostream& operator<<(ostream& ostream, set<T>& v) { for (T it : v) cout << it << " "; return ostream; }

bool prime(int num) { if (num <= 1) return false; int ch = 2; while (ch * ch <= num) { if (!(num % ch)) return false; ch++; }return true; }
int fact(int n) { if (n == 0) return 1; return n * fact(n - 1); }
int nPr(int n, int r) { int val = 1; for (int i = n - r + 1; i <= n; i++) val *= i; return val; }
int nCr(int n, int r) { return fact(n) / (fact(r) * fact(n - r)); }
int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); }
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int biPow(int x, int y) { int val = 1; while (y) { if (y % 2) { val *= x; y--; } else { x *= x; y /= 2; } }return val; }
int modPow(int x, int y, int m) { int val = 1; x %= m; while (y) { if (y % 2) { val *= x; val %= m; y--; } else { x *= x; x %= m; y /= 2; } }return val % m; }
int sumRng(int l, int r) { return (r - l + 1) * (l + r) / 2; }

string mv[8] = { "U", "R", "D", "L", "UR","UL","DR","DL" };
int xd[9] = { -1, 0, 1,  0, -1, -1, 1,  1, 0 };
int yd[9] = { 0, 1, 0, -1,  1, -1, 1, -1, 0 };
int xk[9] = { -1, 1, 2, -2, -1, 1, 2, -2, 0 };
int yk[9] = { 2, -2, 1, -1, -2, 2, -1, 1, 0 };

struct add_s {
	const int def = 0ll;
	inline int op(const int& l, const int& r) { return l + r; }
};
template<typename seg_t>
struct segtree
{
	int n = 0;
	vct<int>tree;
	seg_t func;
	segtree(const vct<int>& arr) {
		n = arr.size();
		tree.assign(n * 4, func.def);
		build(1, 1, n, arr);
	}
	void build(int node, int L, int R, const vct<int>& arr) {
		if (L == R) {
			tree[node] = arr[L - 1];
			return;
		}
		int mid = (L + R) / 2;
		build(2 * node, L, mid, arr);
		build(2 * node + 1, mid + 1, R, arr);
		tree[node] = func.op(tree[2 * node], tree[2 * node + 1]);
	}
	int query(int L, int R) {
		return query(1, 1, n, L, R);
	}
	int query(int node, int L, int R, int l, int r) {
		if (R < l || r < L)	return func.def;
		if (l <= L && R <= r) return tree[node];
		int mid = (L + R) / 2;
		return func.op(query(2 * node, L, mid, l, r), query(2 * node + 1, mid + 1, R, l, r));
	}
	void update(int ind, int val) {
		update(1, 1, n, ind, val);
	}
	void update(int node, int L, int R, int ind, int val) {
		if (ind<L || ind>R) return;
		if (L == R) {
			tree[node] += val;
			return;
		}
		int mid = (L + R) / 2;
		update(2 * node, L, mid, ind, val);
		update(2 * node + 1, mid + 1, R, ind, val);
		tree[node] = func.op(tree[2 * node], tree[2 * node + 1]);
	}
};

void answer(int test)
{
	int n;cin>>n;
	vct<int>a(n);cin>>a;
	auto b = a;
	sort(all(b));
	b.resize(unique(all(b))-b.begin());
	map<int,int>from;
	for(int i : b) from[i] = lower_bound(all(b),i)-b.begin()+1;
	int m = b.size();
	vct<int>temp(m);
	segtree<add_s>bef(temp),aft(temp);
	vct<int>ans(n);
	for(int i = n-1;i>=0;i--){
		aft.update(from[a[i]],1);
	}
	for(int i = 0;i<n;i++){
		bef.update(from[a[i]],1);
		aft.update(from[a[i]],-1);
		int mnbef = bef.query(1,from[a[i]]-1);
		int mnaft = aft.query(1,from[a[i]]-1);
		int mxbef = bef.query(from[a[i]]+1,m);
		int mxaft = aft.query(from[a[i]]+1,m);
		ans[i] += mnbef*mxaft + mxbef*mnaft;
	}
	int q;cin>>q;
	while(q--){
		int x;cin>>x; x--;
		cout<<ans[x]<<ln;
	}
}
bool multiTests = true;
INT main()
{
#ifdef Mhmd_Bakr
	//Contest : -
	//Problem : -
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif
	fastio;
	int tests = 1;
	if (multiTests) cin >> tests;
	for (int test = 1; test <= tests; test++)
	{
		//cout << "Case #" << test << ": ";
		answer(test);
	}
}