#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

#define MOD 998244353

int main(){
  ll n,q;
  cin>>n>>q;
  
  ll A[n+1];
  A[0]=0;
  rep(i,n) cin>>A[i+1];
  
  ll dp[n+1];
  dp[0]=1;  
     
  for(int i=1;i<=n;i++){
    dp[i]=1;
    for(int j=i-1;j>=1;j--){
      dp[j]=(dp[j]*(A[i]-1)%MOD+dp[j-1])%MOD;
    }
    dp[0]=dp[0]*(A[i]-1)%MOD;
  } 
  
  int x;
  rep(i,q){
    cin>>x;
    cout<<dp[x]<<endl;
  }

  return 0;
}