#include <iostream>
#include<algorithm>
#define ll long long
using namespace std;
int main() {
// your code goes here
int t;
cin>>t;
while(t--)
{
ll n,q,k;
cin>>n>>q;
ll a[n+1];
for(ll i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a,a+n+1);
while(q--)
{
cin>>k;
ll *l=lower_bound (a, a+n+1, k);
cout<<l-(a+1)<<endl;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxhbGdvcml0aG0+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCQoJaW50IHQ7CgljaW4+PnQ7Cgl3aGlsZSh0LS0pCgl7CglsbCBuLHEsazsKCWNpbj4+bj4+cTsKICAgbGwgYVtuKzFdOwogICBmb3IobGwgaT0xO2k8PW47aSsrKQogICB7CiAgIAljaW4+PmFbaV07CiAgIH0KICAgCiAgIHNvcnQoYSxhK24rMSk7CiAgIHdoaWxlKHEtLSkKICAgCiAgIHsKICAgCWNpbj4+azsKICAgCWxsICpsPWxvd2VyX2JvdW5kIChhLCBhK24rMSwgayk7CiAgIAljb3V0PDxsLShhKzEpPDxlbmRsOwogICB9CgkJCgl9CgkKCQoJCgkKCQoJCgkKCQoJCgkKCQoJCgkKCXJldHVybiAwOwp9