// PIPRA || HABIB
#include<bits/stdc++.h>
#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 int
#define pb push_back
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define endl "\n"
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) {
os << '{';
for (const auto &x : v) os << " " << x;
return os << '}';
}
using orderedTree = tree<int, null_type, less_equal<int>,
rb_tree_tag, tree_order_statistics_node_update>;
void pipra(){
int n; cin >> n;
vector<int> a(n);
for(auto &e: a){
cin >> e;
}
orderedTree oset, oset1;
vector<int> left_min(n+2), left_max(n+2);
vector<int> right_min(n+2), right_max(n+2);
for(int i=1 ; i<=n ; i++){
int e = a[i-1];
// cout << oset.order_of_key(e) << ' ' << (i-1-oset.order_of_key(e+1)) << endl;
int mn = oset.order_of_key(e);
int mx = oset.size() - oset.order_of_key(e+1);
left_min[i] = mx;
left_max[i] = mn;
oset.insert(e);
// cout << i << ' ' << left_min[i] << ' ' << left_max[i] << endl;
}
// cout << "\nright " << endl;
for(int i=n ; i>0 ; i--){
int e = a[i-1];
int mn = oset1.order_of_key(e);
int mx = oset1.size() - oset1.order_of_key(e);
right_min[i] = mx;
right_max[i] = mn;
// cout << oset.order_of_key(e) << ' ' << (oset.size()-oset.order_of_key(e+1)) << endl;
oset1.insert(e);
// cout << i << ' ' << right_max[i] << ' ' << right_min[i] << endl;
}
vector<int> res(n+1);
for(int i=1 ; i<=n ; i++){
res[i] = 0;
// cout << left_min[i-1] <<
res[i] += min(left_min[i] , right_max[i]);
res[i] += min(right_min[i] , left_max[i]);
}
int q; cin >> q;
while(q--){
int i; cin >> i;
cout << res[i] << endl;
}
}
int32_t main(){
// HABIB
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t; cin>>t;
while(t--) {
pipra();
}
return 0 ;
}