#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int m, q;
cin >> m >> q;
vector<int> p(m);
for(int i = 0; i < m; ++i) {
cin >> p[i];
}
for(int i = 0; i < q; ++i) {
int cur;
cin >> cur;
int oldcur = 0;
int newcur = cur;
int counter = 0;
while(oldcur != newcur) {
counter++;
oldcur = newcur;
auto it = lower_bound(p.begin(), p.end(), oldcur);
if(it == p.begin()) {
oldcur = 0;
newcur = 0;
cout << counter << '\n';
break;
}
it--;
newcur = (oldcur)/(*it) * (*it);
}
if(oldcur != 0 || newcur!= 0) {
cout << "oo\n";
}
}
return 0;
}
