#include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n,t,i,q,j;
  scanf("%d",&t);
  for(i=0;i<t;i++){
      scanf("%d%d",&n,&q);
      int l[n],k[q];
      for(j=0;j<n;j++){
          scanf("%d",&l[j]);
      }
      sort(l,l+n);
      for(j=0;j<q;j++){
          scanf("%d",&k[j]);
          int* p= std::lower_bound(l,l+n,k[j]);
          int r=p-l-1,rcnt=p-l-1;
 
          int x=r+1,cnt=0,el;
          while(x>0){
 
            el=k[j]-l[r];
            x=x-1;
 
            if(x>=el) cnt++;
            x=x-el;
            r--;
          }
                    cout<<cnt<<endl;
          printf("%d\n",cnt+n-rcnt-1);
      }
 
  }
  return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpewogIGludCBuLHQsaSxxLGo7CiAgc2NhbmYoIiVkIiwmdCk7CiAgZm9yKGk9MDtpPHQ7aSsrKXsKICAgICAgc2NhbmYoIiVkJWQiLCZuLCZxKTsKICAgICAgaW50IGxbbl0sa1txXTsKICAgICAgZm9yKGo9MDtqPG47aisrKXsKICAgICAgICAgIHNjYW5mKCIlZCIsJmxbal0pOwogICAgICB9CiAgICAgIHNvcnQobCxsK24pOwogICAgICBmb3Ioaj0wO2o8cTtqKyspewogICAgICAgICAgc2NhbmYoIiVkIiwma1tqXSk7CiAgICAgICAgICBpbnQqIHA9IHN0ZDo6bG93ZXJfYm91bmQobCxsK24sa1tqXSk7CiAgICAgICAgICBpbnQgcj1wLWwtMSxyY250PXAtbC0xOwoKICAgICAgICAgIGludCB4PXIrMSxjbnQ9MCxlbDsKICAgICAgICAgIHdoaWxlKHg+MCl7CgogICAgICAgICAgICBlbD1rW2pdLWxbcl07CiAgICAgICAgICAgIHg9eC0xOwoKICAgICAgICAgICAgaWYoeD49ZWwpIGNudCsrOwogICAgICAgICAgICB4PXgtZWw7CiAgICAgICAgICAgIHItLTsKICAgICAgICAgIH0KICAgICAgICAgICAgICAgICAgICBjb3V0PDxjbnQ8PGVuZGw7CiAgICAgICAgICBwcmludGYoIiVkXG4iLGNudCtuLXJjbnQtMSk7CiAgICAgIH0KCiAgfQogIHJldHVybiAwOwp9Cg==

Mgo1IDIKMjEgOSA1IDggMTAKMTAKMTUKNSAxCjEgMiAzIDQgNQoxMDA=

2
5 2
21 9 5 8 10
10
15
5 1
1 2 3 4 5
100