#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

ll dp[6001][6001];

int main()
{
	int n,q;
	cin >> n >> q;
	vector<ll> A(n);
	for(int i =0;i<n;i++)cin >> A[i];
	dp[0][0] = 1;
	for(int i =0;i<n;i++)
	{
		for(int j = 0;j<6000;j++)
		{
			(dp[i+1][j] += dp[i][j]*(A[i]-1))%=MOD;
			(dp[i+1][j+1] += dp[i][j])%=MOD;
		}
	}
	while(q--)
	{
		int b;
		cin >> b;
		cout<<dp[n][b]<<endl;
	}
}