//#include #include //#include using namespace std; //using namespace atcoder; typedef long long ll; typedef long double ld; typedef unsigned int uint; typedef unsigned long long ull; typedef pair p; const int INF = 1e9; const double eps = 1e-7; const ll LINF = ll(1e18); const int MOD = 998244353; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; const long double pi = 4 * atan(1); #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, vector &v) { for (T &x : v) is >> x; return is; } //cout<> n >> q; vector a(n), b(q); cin >> a; cin >> b; vector dp(n+1, 0); dp[0] = 1; rep(i, n) { vector t_vec(n + 1, 0); rep(j, n + 1) { t_vec[j] += dp[j] * (a[i] - 1) % MOD; t_vec[j] %= MOD; if (j != n) { t_vec[j + 1] += dp[j]; } t_vec[j + 1] %= MOD; } dp = t_vec; } rep(i, q) { cout << dp[b[i]] << "\n"; } }