#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long long cnt[222222], tp[222222];
int solve(long long first) {
  for (int i = 0; i < 50; i++) tp[i] = cnt[i];
  int ans = 0;
  int flag;
  for (int i = 32; i >= 0; i--) {
    if ((((first) >> (i)) & 1)) {
      int need = 1;
      flag = 0;
      for (int j = i; j >= 0; j--) {
        if (tp[j] >= need) {
          tp[j] -= need;
          ans += need;
          flag = 1;
          break;
        }
        if (flag == 0) {
          need = (need - tp[j]) * 2;
          ans += tp[j];
          tp[j] = 0;
        }
        if (flag) break;
      }
    }
    if (flag == 0) return -1;
  }
  return ans;
}
int main() {
  long long n, m, first;
  gn(n, m);
  for (int i = 1; i <= n; i++) {
    gn(first);
    for (int j = 32; j >= 0; j--) {
      if ((((first) >> (j)) & 1)) cnt[j]++;
    }
  }
  for (int i = 0; i < m; i++) {
    gn(first);
    int ans = solve(first);
    println(ans);
  }
  return 0;
}
