#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
  ios_base::sync_with_stdio(false);
  long long n;
  cin >> n;
  long long q;
  cin >> q;
  long long sum = 0;
  vector<long long> v;
  vector<long long> count(40, 0);
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    v.push_back(a);
    long long x = log2(a);
    count[x]++;
    sum += a;
  }
  while (q--) {
    long long a;
    cin >> a;
    if (a > sum) {
      cout << -1 << endl;
      continue;
    }
    long long x = a;
    int c = 0;
    int flag = 0;
    vector<long long> op = count;
    int found = 0;
    int hk = 0;
    while (x > 0) {
      if (x & 1) {
        found = 0;
        if (op[c] >= 1) {
          hk++;
          found = 1;
          op[c]--;
        } else {
          int j = 1;
          for (int i = c; i >= 0; i--) {
            if (op[i] >= j) {
              found = 1;
              op[i] -= j;
              hk += j;
              break;
            } else {
              hk += op[i];
              j -= op[i];
            }
            j = j * 2;
          }
          if (j == 0) {
            found = 1;
          }
          if (found == 0) {
            flag = 1;
            break;
          }
        }
        if (found == 0) {
          flag = 1;
          break;
        }
      }
      c++;
      x = x >> 1;
    }
    if (flag) {
      cout << -1 << endl;
    } else {
      cout << hk << endl;
    }
  }
  return 0;
}
