#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gp_hash_table<ll, int> dp;
int n, m;
vector<ll> prim;
int solve(ll x) {
if (dp.find(x) != dp.end()) {
return dp[x];
} else if (x == 0) {
return dp[x] = 0;
} else {
int curr = INT_MAX;
for (auto p : prim) {
ll to = x - (x % p);
if (to != x) {
curr = min(curr, solve(to) + 1);
}
}
return dp[x] = curr;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll x; cin >> x;
prim.pb(x);
}
for (int i = 0; i < m; i++) {
ll v; cin >> v;
int ans = solve(v);
if (ans == INT_MAX) cout << "oo" << '\n';
else cout << ans << '\n';
}
}
