// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int m, q;
const int maxn=1e7+1;
int f[maxn];
int dp[maxn];

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

	cin>>m>>q;
    
    for (int i=0;i<m;i++){
        int a;
        cin>>a;
        for (int j=a-1;j<maxn;j+=a) f[j]=max(f[j], a-1);
        f[maxn-1]=max(f[maxn-1], (maxn-1)%a);
    }
    for (int i=maxn-2;i>0;i--) f[i]=max(f[i], f[i+1]-1);
    
    dp[0]=0;
    int pos=maxn;
    for (int i=1;i<maxn;i++){
        if (!f[i]) pos=min(pos,i);
        dp[i]=dp[i-f[i]]+1;
    }

    for (int i=0;i<q;i++){
        int n;
        cin>>n;
        if (n>=pos) {
            cout<<"0\n";
            continue;
        }
        cout<<dp[n]<<"\n";
    }
}