#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const int M = 1e6 + 2;
const int inf = 1e9;
vector<int> primes[M];
int idx[M], ans[N], koji[M], dp[M];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q;
multiset<pair<int, int>> s;
for (int i = 0; i < n; i++) {
int x; cin >> x;
s.insert({0, x});
for (int j = x; j < 1e7; j += x) primes[j].push_back(x);
}
for (int i = 1; i <= q; i++) {
int x; cin >> x;
idx[x] = i;
}
for (int i = 1; i < M; i++) {
dp[i] = inf;
for (int j : primes[i]) {
s.erase({koji[j], j});
}
if (!s.empty()) dp[i] = s.begin()->first + 1;
if (idx[i] != 0) ans[idx[i]] = dp[i];
for (int j : primes[i]) {
s.insert({dp[i], j});
koji[j] = dp[i];
}
}
for (int i = 1; i <= q; i++) {
if (ans[i] >= inf) cout << "oo" << en;
else cout << ans[i] << en;
}
return 0;
}
