/**
	author:  shobonvip
	created: 2024.11.12 01:09:32
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

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

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

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, q; cin >> n >> q;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];
	deque<vector<mint>> deq;
	rep(i,0,n) {
		deq.push_back(vector<mint>{a[i]-1, 1});
	}

	while((int)deq.size() >= 2) {
		vector<mint> f1 = deq.front(); deq.pop_front();
		vector<mint> f2 = deq.front(); deq.pop_front();
		deq.push_back(convolution(f1, f2));
	}

	vector<mint> ans = deq.front();
	deq.pop_front();

	rep(i,0,q){
		ll b; cin >> b;
		cout << ans[b].val() << '\n';
	}
}