import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashMap;
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 programajor
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(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, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int q = in.nextInt();

//        int ar[] = new int[n];
//        for (int i = 0; i < n; i++) {
//            ar[i] = in.nextLong();
//        }

            int[] ar = in.nextIntArray(n);

            HashMap<Integer, Integer> hm = new HashMap<>();
            int val = 1;
            int pow = 0;
            int power[] = new int[32];
            for (int i = 0; i < 32; i++) {
                power[pow] = val;
                hm.put(val, pow);
                val = val * 2;
                pow++;
            }

            int freq[] = new int[32];
            for (int i = 0; i < n; i++) {
                freq[hm.get(ar[i])]++;
            }

            while (q > 0) {
                int sum = 0;
                int needed = in.nextInt();
                for (int i = 31; i >= 0; i--) {
                    if (freq[i] == 0) {
                        continue;
                    }
                    int poss = 0;
                    poss = needed / power[i];
                    poss = Math.min(poss, freq[i]);
                    sum += poss;
                    needed = needed - poss * power[i];
                }
                if (needed == 0) {
                    out.println(sum);
                } else {
                    out.println(-1);
                }
                q--;
            }
        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public int[] nextIntArray(int s) {
            int[] in = new int[s];
            for (int i = 0; i < s; i++) {
                in[i] = nextInt();
            }
            return in;
        }

    }
}

