cf524C The Art of Dealing with ATM

ATMs of a well-known bank of a small country are arranged so that they can not give any amount of money requested by the user. Due to the limited size of the bill dispenser (the device that is directly giving money from an ATM) and some peculiarities of the ATM structure, you can get at most k bills from it, and the bills may be of at most two distinct denominations.

For example, if a country uses bills with denominations 10, 50, 100, 500, 1000 and 5000 burles, then at k = 20 such ATM can give sums 100 000 burles and 96 000 burles, but it cannot give sums 99 000 and 101 000 burles.

Let's suppose that the country uses bills of n distinct denominations, and the ATM that you are using has an unlimited number of bills of each type. You know that during the day you will need to withdraw a certain amount of cash q times. You know that when the ATM has multiple ways to give money, it chooses the one which requires the minimum number of bills, or displays an error message if it cannot be done. Determine the result of each of the q of requests for cash withdrawal.

Input

The first line contains two integers n, k (1 ≤ n ≤ 5000, 1 ≤ k ≤ 20).

The next line contains n space-separated integers a_i (1 ≤ a_i ≤ 10⁷) — the denominations of the bills that are used in the country. Numbers a_i follow in the strictly increasing order.

The next line contains integer q (1 ≤ q ≤ 20) — the number of requests for cash withdrawal that you will make.

The next q lines contain numbers x_i (1 ≤ x_i ≤ 2·10⁸) — the sums of money in burles that you are going to withdraw from the ATM.

Output

For each request for cash withdrawal print on a single line the minimum number of bills it can be done, or print  - 1, if it is impossible to get the corresponding sum.

Examples

Input

6 20
10 50 100 500 1000 5000
8
4200
100000
95000
96000
99000
10100
2015
9950

Output

6
20
19
20
-1
3
-1
-1

Input

5 2
1 2 3 5 8
8
1
3
5
7
9
11
13
15

Output

1
1
1
2
2
2
2
-1

 

因为只能取2种面值，所以枚举一种面值，然后搞个map找另一个面值跟它匹配

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<ctime>
#define LL long long
#define inf 0x7ffffff
#define pa pair<int,int>
#define mkp(a,b) make_pair(a,b)
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
inline LL read()
{
    LL x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,k,q,cnt;
int a[5010];
struct p{int v,w,k;}b[100010];
bool operator <(p a,p b){return a.w<b.w||a.w==b.w&&a.k<b.k;}
map<int,pa>mp,mp2;
int main()
{
    mp.clear();mp2.clear();
    n=read();k=read();
    for (int i=1;i<=n;i++)
    {
        a[i]=read();
        for (int j=1;j<=k;j++)
        b[++cnt].v=i,b[cnt].k=j,b[cnt].w=j*a[i];
    }
    sort(b+1,b+cnt+1);
    for (int i=1;i<=cnt;i++)
    {
        int w=b[i].w,kk=b[i].k,v=b[i].v;
        if (mp[w]==mkp(0,0))mp[w]=mkp(kk,v);
        else
        {
            if (mp[w].first>kk)mp2[w]=mp[w],mp[w]=mkp(kk,v);
            else if (mp2[w].first>kk)mp2[w]=mkp(kk,v);
        }
    }
    q=read();
    for (int i=1;i<=q;i++)
    {
        int x=read(),ans=21;
        for (int j=1;j<=n;j++)
        {
            for (int l=1;l<=k;l++)
            {
                int now=l*a[j];
                if (now>x)break;
                if (now==x){ans=min(ans,l);break;}
                pa s=mp[x-now];
                if (s.second==j)s=mp2[x-now];
                if (s==mkp(0,0))continue;
                ans=min(ans,s.first+l);
            }
        }
        printf("%d\n",ans>k?-1:ans);
    }
}