ranking books with fast IO

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string,int> psi;
typedef map<int,int> mii;
typedef map<long long,long long> mll;
typedef map<string,int> msi;
typedef map<char,int> mci;
typedef unordered_set<int> si;
typedef set<long long> sll;
typedef set<string> ss;
typedef set<char> sc;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;

#define FOR(i, a, b) for (auto i=a; i<=(b); i++)
#define FORd(i,b,a) for (int i =b; i >= a; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ins insert

const int MOD = 1000000007;
//type functions here



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tc=1;
    cin>>tc;
    FOR(w,1,tc)
    {
        vi v,kk,k;
        int sizz;
        cin>>sizz;
         si sett;
        FOR(n,1,sizz)
        {
            int temp;
            cin>>temp;

            if(sett.find(temp)==sett.end())
            {k.pb(temp);sett.insert(temp);}
        }


        int m=1;
        cin>>m;
        FOR(q,1,m)
        {
            int curr=25,ans=sz(k);
            cin>>curr;
            int left=0,right=sz(k)-1;
            while(left<=right)
            {
                int mid=(left+right)/2;
                if(curr>=k[mid])
                {
                    ans=mid;
                    right=mid-1;
                }
                else left=mid+1;
            }
            cout<<ans+1<<" ";
        }
        cout<<endl;
    }
    return 0;
}