#include <bits/stdc++.h>
using namespace std;
int comp(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
int main() {
  int n, q, a[200001], b[200001], i, j, d[31], k, c, t, u, p;
  cin >> n >> q;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i <= q; i++) cin >> b[i];
  qsort(a + 1, n, sizeof(int), comp);
  j = 0;
  c = 1;
  for (i = 1; i <= n; i++) {
    while (a[i] != c) {
      j++;
      c = c * 2;
    }
    d[j]++;
  }
  p = j;
  for (i = 1; i <= q; i++) {
    k = 0;
    for (j = p; j >= 0; j--) {
      if (b[i] % 2 == 1) {
        cout << -1 << endl;
        break;
      }
      u = pow(2, j);
      t = min(b[i] / u, d[j]);
      b[i] = b[i] - u * t;
      k = k + t;
      if (b[i] == 0) {
        cout << k << endl;
        break;
      }
    }
  }
  return 0;
}
