#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
long long powmod(long long a, long long b, long long mod) {
  if (b == 0 || a == 1) {
    if (mod == 1)
      return 0;
    else
      return 1;
  }
  if (b % 2 == 0) {
    long long k = powmod(a, b / 2, mod);
    return (k * k) % mod;
  } else {
    long long k = powmod(a, b / 2, mod);
    return ((k * k) % mod * a) % mod;
  }
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a > b)
    return gcd(a % b, b);
  else
    return gcd(b % a, a);
}
long long prime(long long p) {
  for (long long i = 2; i * i <= p; i++) {
    if (p % i == 0 && i < p) return i;
  }
  return 1;
}
long long inv(long long a, long long mod) { return powmod(a, mod - 2, mod); }
long long random_modul() {
  uniform_int_distribution<long long> u1(1e9, 2e9);
  long long pepega = u1(rnd);
  while (prime(pepega) != 1) pepega = u1(rnd);
  return pepega;
}
void solve() {
  long long a, k;
  cin >> a >> k;
  map<long long, long long> pows;
  map<long long, long long> p;
  long long cur = 1;
  for (long long i = 0; i < 33; i++) {
    pows[i] = cur;
    p[cur] = i;
    cur *= 2;
  }
  map<long long, long long> ch;
  for (long long i = 0; i < a; i++) {
    long long x;
    cin >> x;
    ch[p[x]]++;
  }
  for (long long i = 0; i < k; i++) {
    long long x;
    cin >> x;
    long long ans = 0;
    for (long long j = 32; j >= 0; j--) {
      long long q = min(x / pows[j], ch[j]);
      ans += q;
      x -= pows[j] * q;
    }
    if (x == 0)
      cout << ans << "\n";
    else
      cout << "-1\n";
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tututu;
  tututu = 1;
  for (long long qwerty = 0; qwerty < tututu; qwerty++) solve();
  return 0;
}
