#include <bits/stdc++.h>
using namespace std;
long long n, m, k, cnt = 0, I, tmp;
void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long tt = 1;
  while (tt--) {
    solve();
  }
}
vector<long long> v;
long long N;
void solve() {
  long long arr[32] = {0};
  long long brr[32] = {0};
  cin >> N >> m;
  long long po[32];
  po[0] = 1;
  for (long long i = 1; i < 32; i++) {
    po[i] = 2 * po[i - 1];
  }
  for (long long i = 0; i < N; i++) {
    cin >> tmp;
    brr[(long long)log2(tmp)]++;
    arr[(long long)log2(tmp)]++;
  }
  for (long long tu = 0; tu < m; tu++) {
    cin >> n;
    cnt = 0;
    while (n > 0) {
      for (long long i = 31; i > -1; i--) {
        if (arr[i] > 0 and po[i] <= n) {
          long long change = min(arr[i], n / po[i]);
          n -= change * po[i];
          arr[i] -= change;
          cnt += change;
        }
        if (po[i] > n) {
          arr[i] = 0;
        }
      }
      break;
    }
    if (n == 0) {
      cout << cnt << endl;
    } else {
      cout << -1 << endl;
    }
    for (long long i = 0; i < 31; i++) {
      arr[i] = brr[i];
    }
  }
}
