import java.util.*;

public class codeforces{


    static TreeMap<Long,Integer> map;
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int q=sc.nextInt();
        map=new TreeMap<>(new Comparator<Long>() {
            @Override
            public int compare(Long o1, Long o2) {
                return -Long.compare(o1,o2);
            }
        });

        for(int i=0;i<n;i++){
            long input=sc.nextLong();
            if(map.get(input)==null)
                map.put(input,1);
            else
                map.put(input,map.get(input)+1);
        }

        StringBuilder ans=new StringBuilder("");
        for(int i=0;i<q;i++){
            long input=sc.nextLong();
            solve(input,ans);
        }
        System.out.println(ans);
    }


    public static void solve(long num,StringBuilder ans){
        int count=0;
        for(Map.Entry<Long,Integer> entry:map.entrySet()){
            long key=entry.getKey();
            int feq=entry.getValue();
            if(num==0)
                break;

            if(num<key)
                continue;

            long div=num/key;
            if(feq>=div) {
                num = num - (key * (div));
                count+=div;
            }
            else {
                num = num - (key * feq);
                count+=feq;
            }

        }
        if(num!=0)
            count=-1;
        ans.append(count+"\n");
    }
}