/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
template<typename T, typename U> using hmap = __gnu_pbds::gp_hash_table<T, U>;
//#define int long long
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define fs first
#define sc second
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0 //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt" : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
#define check(a) put #a << ": " << a << endl;
void read() {} template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg) ;read(args...) ;}
void print(){} template<typename Arg,typename... Args> void print(Arg arg,Args... args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg arg,Args... args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
//you want to set 2 functions: f(int a, int b) and segTreeNode::update(int val) and 1 parameter: nothing
const int nothing = 0; //nothing means that f(x, nothing) = x
struct segTreeNode {
int val = nothing;
segTreeNode(int _val) : val(_val) {}
void update(int _val) { //function that updates node based on val
this -> val = _val;
}
};
vector<segTreeNode> segTree;
int n, tot;
int f(int a, int b) { //f - query you need to calculate, but for two values
return max(segTree[a].val, segTree[b].val);
}
void update(int nodeToUpdate, int value, int cur = 1, int ll = 1, int rr = tot) {
if (ll == rr) {
segTree[cur].update(value);
return;
}
int p = (ll + rr) / 2;
if (nodeToUpdate <= p)
update(nodeToUpdate, value, cur * 2, ll, p);
else
update(nodeToUpdate, value, cur * 2 + 1, p + 1, rr);
segTree[cur] = f(cur * 2, cur * 2 + 1);
}
int query(int l, int r, int cur = 1, int ll = 1, int rr = tot) {
if (l > r)
return nothing;
if (l == ll && r == rr)
return segTree[cur].val;
int mid = (ll + rr) / 2;
return f(query(l, min(r, mid), cur * 2, ll, mid), query(max(l, mid + 1), r, cur * 2 + 1, mid + 1, rr));
}
void init(vector<int> vals) {
n = vals.size();
tot = n;
while (tot & (tot - 1))
tot++;
segTree = vector<segTreeNode>(tot * 2, segTreeNode(nothing));
for (int i = 0; i < n; i++)
segTree[i + tot].val = vals[i];
for (int i = tot - 1; i; i--)
segTree[i] = f(i * 2, i * 2 + 1);
}
const long long N = 1e7 + 1;
const int LIM = 1;
int dp[N];
void run() {
int m, q;
read(m, q);
vint primes;
priority_queue<pair<int, int>> nxt;
int p[m];
rep(i, 0, m) {
get p[i];
if (p[i] > LIM)
nxt.push({-p[i], i});
else
primes.pb(p[i]);
}
long long mul = 1;
rep(i, 0, m) {
mul *= p[i];
if (mul > N) {
mul = 1e9;
break;
}
}
dp[0] = 0;
int pen = 0;
init(vint(m, 1));
rep(i, 1, N) {
while (!nxt.empty() && -nxt.top().fs == i) {
int j = nxt.top().sc;
int val = -nxt.top().fs;
nxt.pop();
nxt.push({-(val + p[j]), j});
update(j + 1, -pen);
}
int d = query(1, tot) + pen;
dp[i] = dp[i - d] + 1;
pen++;
}
rep(i, 0, q) {
int n;
get n;
if (n >= mul)
put "oo";
else
put dp[n];
eol;
}
}
int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}
