#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];
void solve(){
int n , qu;
cin >> n >> qu;
int arr[n];
for(int i = 0; i < n; i++)cin >> arr[i];
queue<pair<int,int>> q;
for(int i = 0; i < n; i++){
q.push(mp(0,i));
}
for(int i = 1; i <= N-2; i++){
while(q.size()){
if(q.front().vf + arr[q.front().vs] <= i){
int mul = i/arr[q.front().vs];
q.push(mp(mul*arr[q.front().vs] , q.front().vs));
q.pop();
}
else break;
}
ans[i] = 1e9;
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;
}
