#include<bits/stdc++.h>
#include<atcoder/convolution>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const long long MOD = 998244353;

void solve(){
    int n, q;
    cin >> n >> q;
    vector<vector<mint>> poly(n, vector<mint>(2));
    long long a;
    queue<int> que;
    for(int i = 0; i < n; i++){
        que.push(i);
        cin >> a;
        a--;
        a %= MOD;
        poly[i][0] = a;
        poly[i][1] = 1;
    }
    while(que.size() >= 2){
        int i = que.front();
        que.pop();
        int j = que.front();
        que.pop();
        poly[i] = convolution(poly[i], poly[j]);
        que.push(i);
    }
    vector<mint> F = poly[que.front()];
    int b;
    for(int i = 0; i < q; i++){
        cin >> b;
        cout << F[b].val() << "\n";

    }

}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--) solve();
}