#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

void solve()
{
	int n, q;
	cin >> n >> q;
	vector<ll> a(n);
	vector<ll> b(q);
	rep(i, n) cin >> a[i];
	rep(i, q) cin >> b[i];
	const ll m = 998244353;
	rep(j,q){
		vector<vector<ll>> dp(n + 1, vector<ll>(n + 1));
		dp[0][0] = 1;
		rep(i, n)
		{
			rep(k,i+1){
				dp[i + 1][k + 1] += dp[i][k];
				dp[i + 1][k] += (dp[i][k] * (a[i] - 1) + m) % m;
				dp[i + 1][k] %= m;
				dp[i + 1][k + 1] %= m;
			}
		}
		cout << dp[n][b[j]] << endl;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}