#include <algorithm>
#include <bits/stdc++.h>
#define int long long
#define el '\n'
#define oo LLONG_MAX >> 2
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb push_back
#define pep_Guardiola                                                          \
  ios::sync_with_stdio(0);                                                     \
  cin.tie(0);                                                                  \
  cout.tie(0);
using namespace std;

signed main() {
  pep_Guardiola int t;
  cin >> t;
  while (t--) {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (auto &i : a)
      cin >> i;
    sort(all(a));
    vector<int> prefix(n);
    prefix[0] = a[0];
    for (int i = 1; i < n; i++)
      prefix[i] = prefix[i - 1] + a[i];
    auto calc = [&](int l, int r) -> int {
      return prefix[r] - (l == 0 ? 0 : prefix[l - 1]);
    };
    auto go = [&](int k) -> int {
      auto idx = lower_bound(all(a), k) - a.begin();
      idx--;
      int l = 0, r = idx, ans = idx + 1;
      while (l <= r) {
        int mid = (r + l) >> 1;
        if (k * (idx - mid + 1) - calc(mid, idx) <= mid)
          r = mid - 1, ans = mid;
        else
          l = mid + 1;
      }
      return n - ans;
    };
    while (q--) {
      int k;
      cin >> k;
      cout << go(k) << el;
    }
  }
}