import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vadim
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.ni();
            int q = in.ni();
            int[] a = in.na(n);
            int[] v = new int[31];
            for (int i = 0; i < n; i++) {
                v[Integer.numberOfTrailingZeros(a[i])]++;
            }
            int pow[] = new int[31];
            for (int i = 0; i < 31; i++) {
                pow[i] = 1 << i;
            }
            for (int i = 0; i < q; i++) {
                int b = in.ni();
                int cnt = 0;
                int sum = 0;
                for (int j = 30; j >= 0 && b > 0; j--) {
                    if (v[j] > 0 && pow[j] <= b) {
                        cnt = b / pow[j];
                        if (cnt > v[j])
                            cnt = v[j];
                        b -= cnt * pow[j];
                        sum += cnt;
                    }
                }
                if (b == 0) {
                    out.println(sum);
                } else {
                    out.println(-1);
                }
            }
        }

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String ns() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    String rl = in.readLine();
                    if (rl == null) {
                        return null;
                    }
                    st = new StringTokenizer(rl);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int ni() {
            return Integer.parseInt(ns());
        }

        public int[] na(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = ni();
            return a;
        }

    }
}

