#include #define rep(i, n) for (int i = 0; i < n; i++) using namespace std; typedef long long ll; int main() { ll N, Q, MOD = 998244353; cin >> N >> Q; vector A(N), B(Q); rep(i, N) cin >> A[i]; rep(i, Q) cin >> B[i]; vector> ans(N + 1, vector(N + 1, 0)); ans[0][0] = 1; rep(i, N) { rep(j, i + 1) { ans[i + 1][j] += ans[i][j]; ans[i + 1][j] %= MOD; ans[i + 1][j + 1] += ans[i][j] * (A[i] - 1); ans[i + 1][j + 1] %= MOD; } } rep(i, Q) { cout << ans[N][N - B[i]] << "\n"; } }