#include <bits/stdc++.h>
using namespace std;
#define name "TRACKS"
#define endl '\n'
#define ednl endl
#define long long long
#define memset(a, x) memset(a, (x), sizeof(a));
#define inoutf freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define IN(a, b, c) (a <= b && b <= c)
template<typename T, typename U> inline bool amin(T &x, U y) { if(y >= x) return 0; x = y; return 1;}
template<typename T, typename U> inline bool amax(T &x, U y) { if(x >= y) return 0; x = y; return 1;}
template<typename T> inline void read(T& x){
bool Neg = false;
char c;
for (c = getchar(); c < '0' | c > '9'; c = getchar())
if (c == '-') Neg = !Neg;
x = c - '0';
for (c = getchar(); c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
if (Neg) x = -x;
}
const int M = 1e5 + 83, N = 1e7 + 1;
int p[M], m, dp[N];
struct segtree{
int Size;
vector <int> Max;
void init(int n){
Size = n;
Max.assign(n << 2, 0);
}
void push_down(int &x, int mid){
if (Max[x] == 0) return;
amax(Max[x << 1], Max[x]);
amax(Max[x << 1 | 1], Max[x] + mid);
Max[x] = 0;
}
void update(int &l, int &r, int &p, int x, int lx, int rx){
if (r < lx || rx < l) return;
if (l <= lx && rx <= r){
amax(Max[x], p + (lx - l));
return;
}
push_down(x, (rx - lx + 1) >> 1);
int mid = (lx + rx) >> 1;
update(l, r, p, x << 1, lx, mid);
update(l, r, p, x << 1 | 1, mid + 1, rx);
}
void update(int l, int r, int p){update(l, r, p, 1, 1, Size);}
int get(int &i, int x, int lx, int rx){
if (lx == rx) return Max[x];
push_down(x, (rx - lx + 1) >> 1);
int mid = (lx + rx) >> 1;
if (mid < i) return get(i, x << 1 | 1, mid + 1, rx);
else return get(i, x << 1, lx, mid);
}
int get(int i){return get(i, 1, 1, Size);}
}st;
int cal(int n){
if (!n) return 0;
int cur = m, Max = st.get(n);
int &res = dp[n];
if (res >= -1) return res;
if (!Max) return (res = -1);
res = cal(n - Max);
if (res != -1) ++res;
return res;
}
int Solve(){
int q; cin >> m >> q;
for (int i = 1; i <= m; ++i) cin >> p[i];
memset(dp, -0x3f);
queue <int> query;
int Max = 0;
while (q--){
int n; cin >> n;
query.push(n);
amax(Max, n);
}
st.init(Max);
for (int i = 1; i <= m; ++i){
for (int j = p[i]; j <= Max; j += p[i]){
st.update(j - p[i] + 1, j - 1, 1);
}
}
while (query.size()){
int n = query.front();
query.pop();
int tmp = cal(n);
if (tmp == -1) cout << "oo\n";
else cout << tmp << endl;
}
return 0;
}
int main(){
fastio;
int t = 1;
// cin >> t;
while (t--){
Solve();
}
return 0;
}
