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

int main() {
  int n, q;
  cin>>n>>q;
  int a[n];
  for (int i=0; i<n; i++) cin>>a[i];
  int mod = 998244353;
  long long dp[n][n+1];
  for (int i=0; i<n; i++) {
    for (int j=0; j<=n; j++) {
      dp[i][j] = 0;
    }
  }
  dp[0][0] = a[0] - 1;
  dp[0][1] = 1;
  for (int i=1; i<n; i++) {
    dp[i][0] = dp[i-1][0] * (a[i] - 1);
    dp[i][0] %= mod;
    for (int j=1; j<=n; j++) {
      dp[i][j] = dp[i-1][j] * (a[i] - 1);
      dp[i][j] %= mod;
      dp[i][j] += dp[i-1][j-1];
      dp[i][j] %= mod;
    }
  }
  for (int i=0; i<q; i++) {
    int b;
    cin>>b;
    cout<<dp[n-1][b]<<endl;
  }
}