#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 9999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 10000000
#define ALL(a)  a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T;
Vec(P,lli,200000,0);    
vector<lli> divide_and_solve(int left,int right){//f_l(x)からf_r(x)までの積
  if(right-left==1){
    Vec(v,lli,2,1);
    v[1]=P[left];
    return v;
  }
  auto vl=divide_and_solve(left,(left+right)/2);
  auto vr=divide_and_solve((left+right)/2,right);
  int ls=vl.size(),rs=vr.size();
  Vec(marge,lli,ls+rs-1,0);
  rep(i,0,ls)rep(j,0,rs)marge[i+j]+=vl[i]*vr[j];
  return marge;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> N >> M;
  Vec(Q,lli,M,0);
  P.resize(N);
  rep(i,0,N){
    cin >> P[i];
    P[i]--;
    P[i]%=mod;
  }
  rep(i,0,M)cin >> Q[i];
  auto ans=divide_and_solve(0,N);
  Rev(ans);
  rep(i,0,M)Out(ans[Q[i]]%mod);
}