#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<double, int> P;
const ll linf = (1ll << 61);
const int inf = 1001001001;
const int mod = 998244353;

ll dp[2][6005];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	vector<ll> a(n);
	rep(i, n) cin >> a[i];
	dp[0][0] = a[0] - 1;
	dp[0][1] = 1;
	bool flag = 0;
	rrep(i, n) {
		flag ^= 1;
		rep(j, n + 1) {
			if (j) dp[flag][j] += dp[flag ^ 1][j] * (a[i] - 1) + dp[flag ^ 1][j - 1];
			else dp[flag][j] += dp[flag ^ 1][j] * (a[i] - 1);
			dp[flag][j] %= mod;
		}
		rep(j, n + 1) dp[flag ^ 1][j] = 0;
	}
	while (q--) {
		int b;
		cin >> b;
		cout << dp[flag][b] << endl;
	}
 	return 0;
}