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

constexpr int64_t mod = 998244353;

vector<int64_t> mul(const vector<int64_t> &a, const vector<int64_t> &b) {
    int n = a.size();
    if (n == 1) return { a.at(0) * b.at(0) % mod, 0 };
    vector<int64_t> al(n / 2), ah(n / 2), as(n / 2), bl(n / 2), bh(n / 2), bs(n / 2);
    for (int i = 0; i < n / 2; i++) {
        al.at(i) = a.at(i);
        ah.at(i) = a.at(i + n / 2);
        as.at(i) = (al.at(i) + ah.at(i)) % mod;
        bl.at(i) = b.at(i);
        bh.at(i) = b.at(i + n / 2);
        bs.at(i) = (bl.at(i) + bh.at(i)) % mod;
    }
    vector<int64_t> l = mul(al, bl), h = mul(ah, bh), s = mul(as, bs);
    for (int i = 0; i < n; i++) {
        s.at(i) += 2 * mod - l.at(i) - h.at(i);
    }
    vector<int64_t> res(2 * n);
    for (int i = 0; i < n; i++) {
        res.at(i) += l.at(i);
        res.at(i + n / 2) += s.at(i);
        res.at(i + n) += h.at(i);
    }
    for (int i = 0; i < 2 * n; i++) {
        res.at(i) %= mod;
    }
    return res;
}

int main() {
    int n, q;
    cin >> n >> q;
    vector<int64_t> a(n), b(q);
    for (int i = 0; i < n; i++) {
        cin >> a.at(i);
        a.at(i) %= mod;
    }
    for (int i = 0; i < q; i++) {
        cin >> b.at(i);
    }
    int m = 1, d = 1;
    while (m < n) m *= 2;
    vector<vector<int64_t>> c(m);
    for (int i = 0; i < m; i++) {
        if (i < n) {
            c.at(i) = { (a.at(i) + mod - 1) % mod, 1 };
        } else {
            c.at(i) = { 1, 0 };
        }
    }
    while (d < m) {
        for (int i = 0; i < m; i += 2 * d) {
            c.at(i) = mul(c.at(i), c.at(i + d));
        }
        d *= 2;
    }
    for (int i = 0; i < q; i++) {
        cout << c.at(0).at(b.at(i)) << "\n";
    }
}