/* -*- coding: utf-8 -*-
 *
 * 1066.cc:  No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 6000;
const int MOD = 998244353;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
int dp[MAX_N + 1][MAX_N + 1];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n, q;
  scanf("%d%d", &n, &q);

  for (int i = 0; i < n; i++) scanf("%d", as + i);

  dp[0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++) {
      addmod(dp[i + 1][j], (ll)dp[i][j] * (as[i] - 1) % MOD);
      addmod(dp[i + 1][j + 1], dp[i][j]);
    }

  while (q--) {
    int bi;
    scanf("%d", &bi);
    printf("%d\n", dp[n][bi]);
  }
  return 0;
}