#include using namespace std; #ifdef LOCAL #include "debug.h" #else #define DEBUG(...) #endif template > constexpr T power(T a, long long n, Op op = Op(), T e = {1}) { assert(n >= 0); while (n) { if (n & 1) e = op(e, a); if (n >>= 1) a = op(a, a); } return e; } template struct modular { using m = modular; static constexpr unsigned mod = M; unsigned v; modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {} m operator-() const { return m() -= *this; } m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; } m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; } m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; } m& operator/=(m b) { return *this *= power(b, mod - 2); } friend m operator+(m a, m b) { return a += b; } friend m operator-(m a, m b) { return a -= b; } friend m operator*(m a, m b) { return a *= b; } friend m operator/(m a, m b) { return a /= b; } friend bool operator==(m a, m b) { return a.v == b.v; } }; using mint = modular<998244353>; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n, q; cin >> n >> q; vector dp(n + 1); dp[0] = 1; for (int i = 0; i < n; ++i) { int a; cin >> a; vector ndp(n + 1); for (int x = 0; x <= i; ++x) { ndp[x + 1] += dp[x]; ndp[x] += dp[x] * (a - 1); } swap(dp, ndp); } while (q--) { int b; cin >> b; cout << dp[b].v << '\n'; } }