#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
bool remender(ll a , ll b){return a%b;}
//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);
const int N = 10000002;
int ans[N];
vector<int> v[N];
void solve(){
int n , qu;
cin >> n >> qu;
int arr[n];
for(int i = 0; i < n; i++)cin >> arr[i];
int mx = 0;
for(int i = 0; i < n; i++)mx = max(mx , arr[i]);
for(int i = 0; i < n; i++){
for(int j = arr[i]; j <= N-2; j+=arr[i]){
v[j].pb(i);
}
}
int cur[n];
queue<pair<int,int>> q;
for(int i = 0; i < n; i++){
cur[i] = 0;
q.push(mp(0,i));
}
ans[0] = 0;
for(int i = 1; i <= N-2; i++){
ans[i] = 1e9;
for(int j : v[i]){
q.push(mp(i,j));
cur[j] = i;
}
while(q.size()){
pair<int,int> p = q.front();
if(cur[p.vs] == p.vf)break;
q.pop();
}
ans[i] = ans[q.front().vf]+1;
}
while(qu--){
int x;
cin >> x;
if(ans[x] >= 1e9)cout << "oo\n";
else cout << ans[x] << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// int t;cin>>t;
// while(t--){
solve();
//}
return 0;
}
