#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
void solve(){
int n, q; cin >> n >> q;
vector<int> p(n);
for(int i = 0; i < n; ++i) cin >> p[i];
#define tri array<int, 3>
priority_queue<tri, vector<tri>, greater<tri>> pq;
for(int i: p) pq.push({{0, 0, i}});
const int N = 1e7 + 69, INF = 1e9;
vector<int> dp(N, 1e9);
dp[0] = 0;
for(int i = 1; i <= N; ++i){
vector<tri> divisible_list;
while(pq.size()){
array<int, 3> u = pq.top();
if (u[1] + u[2] > i) break;
pq.pop();
if (i % u[2] != 0) {
u[1] += u[2];
u[0] = dp[u[1]];
pq.push(u);
}
else divisible_list.push_back(u);
}
if (pq.size()) dp[i] = pq.top()[0] + 1;
for(tri u: divisible_list){
u[1] += u[2];
u[0] = dp[u[1]];
pq.push(u);
}
}
// for(int i = 0; i <= 10; ++i) cout << dp[i] << " ";
// cout << "\n";
while(q--){
int x; cin >> x;
if (dp[x] >= INF) cout << "oo\n";
else cout << dp[x] << "\n";
}
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
