import java.io.*;
import java.util.*;
import java.util.Map.Entry;
import javax.swing.text.InternationalFormatter;
import java.math.*;
import java.util.Arrays;
public class RATHOD 
{
     public static void main(String[] args) throws IOException
    { 
     Reader sc=new Reader();    
     int n=sc.nextInt();
     int q=sc.nextInt();
     long ar[]=new long[n];
     int i,j;
     j=-1;
     HashMap<Long,Long> hm=new HashMap<Long,Long>();
     ArrayList<Long> arl=new ArrayList<>();
     for(i=0;i<n;i++)
     {
     ar[i]=sc.nextLong();
     int power=0;
     long temp=ar[i];
     if(hm.containsKey(ar[i]))
     {
       hm.replace(ar[i],(hm.get(ar[i])+1));
     }
     else
     {
         hm.put(ar[i],((long) 1));
         arl.add(-ar[i]);
     }
     }
     Collections.sort(arl);
    
     for(i=1;i<=q;i++)
     {
         long val=sc.nextLong();
         long sol=0;
         int flag=0;
         int len=arl.size();
         for(j=0;j<len;j++)
         {
             long req=(val)/(-arl.get(j));
             //System.out.println("r"+req);
             if(req==0)
             continue;
             else
             {
                if(hm.get(-arl.get(j))>=req)
                {
                    sol=sol+req;
                    val=val-(-arl.get(j))*req;
                }
                else
                {
                    val=val-(-arl.get(j))*hm.get(-arl.get(j));
                    sol=sol+-arl.get(j);
                }
             }
             if(val==0)
             {
                 flag=1;
                 break; 
             }
         }
         if(flag==0)
         {
            System.out.println(-1); 
         }
         else
         System.out.println(sol);
     }
    }
    
   
	// _________________________TEMPLATE_____________________________________________________________

	// private static int gcd(int a, int b) {
	// if(a== 0)
	// return b;
	//
	// return gcd(b%a,a);
	// }

	// static class comp implements Comparator<pair> {
	//
	// @Override
	// public int compare(pair o1, pair o2) {
	// return o2.b - o1.b;
	// }
	//
	// }

	static class pair implements Comparable<pair> {
		int min;
		int max;
		int ans;

		pair(int a, int b) {
			min = a;
			max = b;
		}

		@Override
		public int compareTo(pair o) {

			return (int) (this.min - o.max);

		}
	}

	public static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[100000 + 1]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}

		public int[] nextIntArray(int n) throws IOException {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}

		public long[] nextLongArray(int n) throws IOException {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}

		public int[][] nextInt2DArray(int m, int n) throws IOException {
			int[][] arr = new int[m][n];
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++)
					arr[i][j] = nextInt();
			}
			return arr;
		}

	}

}