#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const long long MOD = 998244353;

int n, q;
int a[6060];
long long dp[2][6060];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> q;
  REP (i, n) cin >> a[i];

  dp[0][0] = 1;
  REP (i, n) {
    int cur = i&1;
    int nxt = i+1&1;
    fill(dp[nxt], dp[nxt] + n + 1, 0);
    REP (j, n) {
      dp[nxt][j] += dp[cur][j] * (a[i] - 1) % MOD;
      dp[nxt][j] %= MOD;
      dp[nxt][j+1] += dp[cur][j];
      dp[nxt][j+1] %= MOD;
    }
  }

  while (q--) {
    int b;
    cin >> b;
    cout << dp[n&1][b] << endl;
  }
  
  return 0;
}