#include #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; typedef long long ll; typedef pairP; const int MOD=1000000007; const int INF=0x3f3f3f3f; const ll INFL=0x3f3f3f3f3f3f3f3f; ll dp[7000][7000]; int a[7000]; int main(){ int n,q;cin>>n>>q; rep(i,n)scanf("%d",&a[i]); dp[0][0]=1; rep(i,n)rep(j,n){ if(dp[i][j]==0)continue; (dp[i+1][j+1]+=dp[i][j])%=MOD; (dp[i+1][j]+=dp[i][j]*(a[i]-1))%=MOD; } rep(i,q){ int b;scanf("%d",&b); printf("%lld\n",dp[n][b]); } }