import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class CF1003D_CoinsAndQueries {
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		public Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

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

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

	}

	static int max(int a, int b) {
		return Math.max(a, b);
	}

	static int min(int a, int b) {
		return Math.min(a, b);
	}

	static void print(Object b) {
		System.out.print(b);
	}

	static void println(Object b) {
		System.out.println(b);
	}

	static void println() {
		System.out.println();
	}
	static int[] pow;
	public static int solution(int n, int q, int[] arr) {
		int count = 0;
		for (int i = 30; i >= 0; i--) {
			int pow = 1 << i;
			if (pow > q || arr[i] == 0)
				continue;
			int a = q / pow;
			q -= pow * Math.min(a, arr[i]);
			count += Math.min(a, arr[i]);

		}
		if (q != 0)
			return -1;
		return count;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner();
		int n = scanner.nextInt();
		int q = scanner.nextInt();
//		int[] arr = new int[n];
		int[] arr = new int[31];
		for (int i = 0; i < n; i++) {
			int num = scanner.nextInt();
			for (int p = 30; p >= 0; p--) {
				if (num == Math.pow(2, p)) {
					arr[p]++;
				}
			}
		}
		for (int i = 0; i < q; i++) {
			println(solution(n, scanner.nextInt(), arr));
		}

	}

}
