#include <bits/stdc++.h>
using namespace std;
long long n, q, arr[300005];
map<long long, long long> tct;
void solve() {
  cin >> n >> q;
  for (long long i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  long long s = 0;
  for (long long i = 0; i < n; i++) {
    s += arr[i];
    if (tct.find(arr[i]) == tct.end())
      tct[arr[i]] = 1;
    else
      tct[arr[i]]++;
  }
  long long bas = arr[0];
  long long ans, z;
  for (long long i = 0; i < q; i++) {
    cin >> z;
    if (z % bas || z > s) {
      cout << -1 << "\n";
      continue;
    }
    ans = 0;
    map<long long, long long> M;
    for (auto x : tct) M.insert(x);
    while (z) {
      if (M.empty()) {
        ans = -1;
        break;
      }
      auto it = M.lower_bound(z);
      if (it->first != z && it == M.begin()) {
        ans = -1;
        break;
      }
      if (it->first != z) it--;
      long long temp = min(z / (it->first), it->second);
      ans += temp;
      z -= (temp * (it->first));
      it->second -= temp;
      if (it->second <= 0) {
        M.erase(it);
      }
    }
    cout << ans << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (long long a = 0; a < t; a++) {
    solve();
  }
  return 0;
}
