#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 998244353;
ll dp[6001];

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


	int N, Q;
	cin >> N >> Q;

	int A[6000];
	rep(i, N) cin >> A[i];

	dp[0] = 1;
	rep(i, N) {
		for (int j = i + 1; j >= 0; j--) {
			dp[j + 1] = (dp[j + 1] + dp[j]) % mod;
			dp[j] = dp[j] * (A[i] - 1) % mod;
		}
	}

	rep(i, Q) {
		int b;
		cin >> b;
		co(dp[b]);
	}



	Would you please return 0;
}