#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int gen = 3;
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
ll pw(ll a, ll b){
    ll x = 1;
    while (b){
        while(!(b&1)){
            (a *= a) %= mod; b /= 2;
        }
        (x *= a) %= mod; b--;
    }
    return x;
}

void _ntt(vector <ll> &a,int sign) {
    int i,j,k,n = a.size(),m = 1;
    while(m<n || m==1) m <<= 1;
    a.resize(m); n = m;
    const int g = 3;
    ll h = pw(g,(mod - 1)/n);
    if(sign==-1) h = (int)mod_inv(h,mod);
    i = 0;
    for(j=1;j<n - 1;j++) {
        for(k=(n >> 1); k>(i ^= k); k >>= 1);
        if(j<i) swap(a[i],a[j]);
    }
    for(i=1;i<n;i*= 2){
        const int i2 = 2*i;
        const ll base = pw(h,n/i2);
        ll w = 1;
        for(j=0;j<i;j++){
            for(k=j;k<n;k += i2){
                ll u = a[k];
                ll d = a[k + i]*w%mod;
                a[k] = u + d;
                if(a[k]>=mod) a[k] -= mod;
                a[k + i] = u - d;
                if(a[k + i]<0) a[k + i] += mod;
            }
            (w *= base) %= mod;
        }
    }
    for(ll x: a){
        if(x<0) x += mod;
    }
}

void ntt(vector<ll>& input) {
	_ntt(input, 1);
}
void intt(vector<ll>& input) {
	_ntt(input, -1);
    ll x = input.size();
	const int n_inv = mod_inv(x, mod);
	for (auto& x : input) x = x * n_inv % mod;
}

void multiply(vector<ll> & input1,vector<ll> & input2){
    int l = input1.size(),r = input2.size();
    int s = 1;
    while(s<l + r) s <<= 1;
    input1.resize(s); input2.resize(s);
    ntt(input1); ntt(input2);
    for(int i=0;i<input1.size();i++){
        (input1[i] *= input2[i]) %= mod;
    }
    intt(input1);
    input1.resize(l + r);
}

vector<ll> v[200010];
void solve(int l,int r){
    if(l==r) return;
    if(r - l==1){
        multiply(v[l],v[r]);
        return ;
    }
    solve(l,(l + r)/2); solve((l + r)/2 + 1,r);
    multiply(v[l],v[(l + r)/2 + 1]);
}

int main(){
    int i,n,q;
    cin >> n >> q;
    for(i=0;i<n;i++){
        ll a; cin >> a;
        v[i].push_back((a - 1 + mod)%mod); v[i].push_back(1);
    }
    solve(0,n - 1);
    for(i=0;i<q;i++){
        int b; cin >> b;
        cout << v[0][b] << endl;
    }
}