#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=3.1415926535897932384626433832795;
const ll INF = 1LL<<62;
const ll MINF = -1LL<<62;

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

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

	return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)

const int MAXN=10100001;
int ans[MAXN];
int mn[MAXN];

int main() {
	IO;
    int m,q;
    cin>>m>>q;
    
    vector<int> nums;
    for(int i=0;i<m;++i) {
        int x;
        cin>>x;
        if(x>1) nums.push_back(x);
    }
    
    nums.resize(distance(nums.begin(), unique(all(nums))));
    assert(sz(nums)==m);

    for(int i=0;i<MAXN;++i) mn[i]=1e9;
    
    for(int i:nums) {
        for(int j=0;j+i-1<MAXN;j+=i) {
            mn[j+i-1]=min(mn[j+i-1], j);
        }
    }
    for(int i=MAXN-2;i>=0;i--) {
        mn[i]=min(mn[i], mn[i+1]);
    }
    
    for(int i=1;i<MAXN;++i) {
        if(mn[i]<i) ans[i]=ans[mn[i]]+1;
        else break; 
    }
    
    for(int i=0;i<q;++i) {
        int akt;
        cin>>akt;
        cout<<ans[akt]<<"\n";
    }
	return 0;
}