1003D. Coins and Queries（思维+贪心）

Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. It is guaranteed that all the values are integer powers of $2$ (i.e. $a_i=2^d$ for some non-negative integer number $d$

).

Polycarp wants to know answers on $q$

queries. The $j$-th query is described as integer number $b_j$. The answer to the query is the minimum number of coins that is necessary to obtain the value $b_j$ using some subset of coins (Polycarp can use only coins he has). If Polycarp can't obtain the value $b_j$, the answer to the $j$

-th query is -1.

The queries are independent (the answer on the query doesn't affect Polycarp's coins).

Input

The first line of the input contains two integers $n$

and $q$ ( $1\le n,q\le 2\cdot {10}^5$

) — the number of coins and the number of queries.

The second line of the input contains $n$

integers $a_1,a_2,\dots ,a_n$ — values of coins ( $1\le a_i\le 2\cdot {10}^9$). It is guaranteed that all $a_i$ are integer powers of $2$ (i.e. $a_i=2^d$ for some non-negative integer number $d$

).

The next $q$

lines contain one integer each. The $j$-th line contains one integer $b_j$ — the value of the $j$-th query ( $1\le b_j\le {10}^9$

).

Output

Print $q$

integers $an{s}_j$. The $j$-th integer must be equal to the answer on the $j$-th query. If Polycarp can't obtain the value $b_j$ the answer to the $j$

-th query is -1.

Example

Input

Copy

5 4
2 4 8 2 4
8
5
14
10

Output

Copy

1
-1
3
2

题意：n个硬币，q次询问。第二行给你n个硬币的值（保证都是2的次幂），每次询问组成x块钱至少需要多少硬币

思路：由二进制表示一个数可知，任何一个数均能由若干个数（均为2的次幂）的和构成，要想用最少的硬币凑成x，则应该尽量用面值比较大的硬币，所以，从大到小枚举硬币面值。

代码：

#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
const int N = 2e5+5;
map<int,int>mp;
int main(){
	int n,q;
	cin>>n>>q;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		mp[x]++;
	}
	while(q--){
		int x;
		cin>>x;
		int ans=0;
		for(int i=1<<30;i>=1;i/=2){
			int k=min(mp[i],x/i);
			ans+=k;
			x-=k*i;
		}
        if(x) cout<<"-1"<<endl;
        else cout<<ans<<endl;
	}
	return 0;
}