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

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

int m = 20000000;

int dp[10000009];

vector<int> b[10000009];


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
	int n , q; cin >> n >> q;
    vector<int> a;
    for(int i = 0; i < n; i++){
        int y; cin >> y;
        a.push_back(y);
    }
    sort(a.begin() , a.end());
    a.erase(unique(a.begin() , a.end()) , a.end());
    dp[0] = 0;
    queue<array<int , 2>> c; 
    for(int i = 0; i < a.size();i++){
        c.push({i , 0});
        for(int j = 0; j*a[i] < 10000009; j++){
            b[j*a[i]].push_back(i);
        }
    }
    vector<int> k(a.size() , 0);
    for(int i = 1; i < 10000009; i++){
        for(int x : b[i]){
            k[x] = i;
            c.push({x , i});
        }
        while(c.front()[1] != k[c.front()[0]])c.pop();
        if(c.front()[1] == i)dp[i] = m;else dp[i] = dp[c.front()[1]]+1;
    }
    while(q--){
        int u; cin >> u;
        cout<< (dp[u]>u?0:dp[u]) << "\n";
    }
}