#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q;
  cin >> n >> q;
  long long int a[n];
  map<long long int, long long int> mp;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
  }
  vector<long long int> v;
  for (auto it = mp.begin(); it != mp.end(); it++) v.push_back(it->first);
  while (q--) {
    long long int no;
    cin >> no;
    long long int cc = 0;
    int lo = 0, hi = v.size() - 1, mid, ans = -1;
    while (lo <= hi) {
      mid = (hi + lo) / 2;
      if (v[mid] <= no) {
        ans = mid;
        lo = mid + 1;
      } else
        hi = mid - 1;
    }
    if (ans == -1) {
      cout << -1 << "\n";
      continue;
    }
    for (int i = ans; i >= 0; i--) {
      long long int p = mp[v[i]];
      long long int ka = v[i];
      if (p * ka <= no) {
        no -= (p * ka);
        cc += p;
      } else {
        long long int kh = no / ka;
        cc += kh;
        no -= kh * ka;
      }
    }
    if (no == 0)
      cout << cc << "\n";
    else
      cout << -1 << "\n";
  }
  return 0;
}
