#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e7+50;
const int mod=1e9+7;
using namespace std;
int n,q,f[nmax],mx[2*nmax],x,i,j;
int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n>>q;
for(i=1;i<=n;i++)
{
cin>>x;
for(j=0;j<=1e7;j+=x)mx[j+x-1]=max(mx[j+x-1],x-1);
}
for(i=2e7;i>=1;i--)mx[i]=max(mx[i],mx[i+1]-1);
for(i=1;i<=1e7;i++)
{
f[i]=inf;
f[i]=f[i-mx[i]]+1;
}
while(q--)
{
cin>>x;
if(f[x]>=inf)cout<<"oo\n";
else cout<<f[x]<<'\n';
}
return 0;
}
