#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1ll;
  while (b > 0) {
    if (b % 2 != 0) res = (res * a) % 10000000007;
    a = (a * a) % 10000000007;
    b /= 2;
  }
  return res % 10000000007;
}
long long ncr(long long n, long long k) {
  if (k > n - k) k = n - k;
  long long pro = 1;
  for (long long i = 0; i < k; i++) {
    pro = (pro * (n - i)) % 10000000007;
    pro /= (i + 1);
  }
  return (pro) % 10000000007;
}
void swap(long long *a, long long *b) {
  long long temp = *a;
  *a = *b;
  *b = temp;
}
void solve() {
  long long n, a, q;
  cin >> n >> q;
  vector<long long> arr(32);
  for (int i = 0; i < n; i++) {
    cin >> a;
    long long x = log2(a);
    arr[x]++;
  }
  long long pow2[32];
  pow2[0] = 1;
  for (int i = 1; i < 32; i++) {
    pow2[i] = pow2[i - 1] * 2ll;
  }
  while (q--) {
    cin >> a;
    long long cnt = 0;
    for (int i = 31; i >= 0 && a > 0; i--) {
      long long x = pow2[i];
      long long div = min((a / x), arr[i]);
      a -= div * x;
      cnt += div;
    }
    if (a == 0)
      cout << cnt << "\n";
    else
      cout << "-1"
           << "\n";
  }
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
