#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long max3(long long x, long long y, long long z) {
  return max(max(x, y), z);
}
long long min3(long long x, long long y, long long z) {
  return min(min(x, y), z);
}
const long long M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int& a, int b) {
  a += b;
  if (a >= mod) {
    a -= mod;
  }
}
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
long long power(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = ((x % mod) * (x % mod)) % mod;
    n = n / 2;
  }
  return result;
}
long long n, q;
long long arr[35];
long long temp;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q;
  for (int i = 0; i < n; i++) {
    cin >> temp;
    for (int j = 0; j <= 32; j++) {
      if ((1ll << j) == temp) {
        arr[j]++;
        break;
      }
    }
  }
  for (long long i = 0; i < q; i++) {
    cin >> temp;
    long long ans = 0;
    for (long long j = 32; j >= 0; j--) {
      long long curr = arr[j];
      if (temp >= 1ll << (j)) {
        long long div = temp / (1ll << (j));
        int add = min(div, curr);
        ans += add;
        temp -= (add) * (1ll << (j));
      }
    }
    if (temp == 0)
      cout << ans << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}
