#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

template<int_fast64_t MOD> struct modint{
    using i64=int_fast64_t;
    i64 a;
    modint(const i64 a_=0): a(a_){
        if(a>MOD) a%=MOD;
        else if(a<0) (a%=MOD)+=MOD;
    }
    modint inv(){
        i64 t=1, n=MOD-2, x=a;
        while(n){
            if(n&1) (t*=x)%=MOD;
            (x*=x)%=MOD;
            n>>=1;
        }
        modint ret(t);
        return ret;
    }
    bool operator==(const modint x) const{return a==x.a;}
    bool operator!=(const modint x) const{return a!=x.a;}
    modint operator+(const modint x) const{
        return modint(*this)+=x;
    }
    modint operator-(const modint x) const{
        return modint(*this)-=x;
    }
    modint operator*(const modint x) const{
        return modint(*this)*=x;
    }
    modint operator/(const modint x) const{
        return modint(*this)/=x;
    }
    modint operator^(const lint x) const{
        return modint(*this)^=x;
    }
    modint &operator+=(const modint &x){
        a+=x.a;
        if(a>=MOD) a-=MOD;
        return *this;
    }
    modint &operator-=(const modint &x){
        a-=x.a;
        if(a<0) a+=MOD;
        return *this;
    }
    modint &operator*=(const modint &x){
        (a*=x.a)%=MOD;
        return *this;
    }
    modint &operator/=(modint x){
        (a*=x.inv().a)%=MOD;
        return *this;
    }
    modint &operator^=(lint n){
        i64 ret=1;
        while(n){
            if(n&1) (ret*=a)%=MOD;
            (a*=a)%=MOD;
            n>>=1;
        }
        a=ret;
        return *this;
    }
    modint operator-() const{
        return modint(0)-*this;
    }
    modint &operator++(){
        return *this+=1;
    }
    modint &operator--(){
        return *this-=1;
    }
    bool operator<(const modint x) const{
        return a<x.a;
    }
};

using mint=modint<998244353>;

vector<mint> fact;
vector<mint> revfact;

void setfact(int n){
    fact.resize(n+1); revfact.resize(n+1);
    fact[0] = 1;
    rep(i, n) fact[i+1] = fact[i] * mint(i+1);

    revfact[n] = fact[n].inv();
    for(int i=n-1; i>=0; i--) revfact[i] = revfact[i+1] * mint(i+1);
}

mint getC(int n, int r){
    if(n<r) return 0;
    return fact[n] * revfact[r] * revfact[n-r];
}

using poly=vector<mint>;
 
void ntt(poly &f, bool inverse){
    int n=f.size();
    int bit_num = 0;
    while((1 << bit_num) < n) ++bit_num;
    rep(i, n){
        int j = 0;
        rep(k, bit_num) j |= (i >> k & 1) << (bit_num - k - 1);
        if(i < j) swap(f[i], f[j]);
    }
 
    for(int k=1; k<n; k*=2){
        mint r_i=1;
        mint r=mint(3)^(998244352/(2*k));
        if(inverse) r=r.inv();
        rep(i, k){
            for(int j=0; j<n; j+=k*2){
                mint s = f[i+j];
                mint t = f[i+j+k] * r_i;
                f[i+j] = s + t;
                f[i+j+k] = s - t;
            }
            r_i*=r;
        }
    }
 
    if(inverse){
        mint sz={n};
        rep(i, n) f[i]/=sz;
    }
}
 
void conv(poly &a, poly &b){
    int sz = a.size() + b.size() - 1;
    int n = 1;
    while(n < sz) n *= 2;
    a.resize(n);
    b.resize(n);
 
    ntt(a, false);
    ntt(b, false);
 
    rep(i, n) a[i]*=b[i];
    ntt(a, true);
}

int main(){
    int n, qq;
    scanf("%d%d", &n, &qq);
    mint a[n];
    rep(i, n) scanf("%lld", &a[i].a);

    int sz = 1;
    while(sz < n) sz *= 2;
    vector<poly> ps(2*sz-1, {1});
    rep(i, n) ps[i+sz-1] = {1, a[i]-1};
    for(int i=n+sz-2; i>0; i-=2){
        conv(ps[i-1], ps[i]);
        swap(ps[(i-1)/2], ps[i-1]);
        ps[i-1].clear();
        ps[i].clear();
    }

    rep(_, qq){
        int b;
        scanf("%d", &b);
        printf("%lld\n", ps[0][n-b].a);
    }
}