#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define sort_rev sort(v.rbegin(),v.rend());
#define all_n for(int i=0;i<n;i++)
#define print for(auto it:v)cout<<it<<" "
#define print_vp for(auto it:vp)cout<<it.first<<" "<<it.second<<endl
#define print_mp for(auto it:mp) cout<<it.first<<" "<<it.second<<endl
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll n;
        cin>>n;
        vv v(n);
        all_n{
            cin>>v[i];
        }
        sort(all_v);
        ll q;
        cin>>q;
        while (q--){
            ll x;
            cin>>x;
            ll i= lower_bound(v.begin(),v.end(),x)-v.begin();
            ll x1=0,x2=0;
            if (v[i]==x){
                x2=n-i-1;
                x1=i;
            }
            else{
                x2=n-i;
                x1=i;
            }
//            cout<<x1<<" "<<x2<<endl;
            cout<<min(x1,x2)<<endl;
        }
    }
    return 0;
}