/** * @FileName b.cpp * @Author kanpurin * @Created 2020.05.29 22:16:28 **/ #include "bits/stdc++.h" using namespace std; typedef long long ll; constexpr int MOD = 998244353; struct mint { private: long long x; public: mint(long long x = 0) :x((MOD+x)%MOD) {} mint(std::string &s) { long long z = 0; for (int i = 0; i < s.size(); i++) { z *= 10; z += s[i] - '0'; z %= MOD; } this->x = z; } mint& operator+=(const mint &a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint &a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint &a) { (x *= a.x) %= MOD; return *this; } mint& operator/=(const mint &a) { long long n = MOD - 2; mint u = 1, b = a; while (n > 0) { if (n & 1) { u *= b; } b *= b; n >>= 1; } return *this *= u; } mint operator+(const mint &a) const { mint res(*this); return res += a; } mint operator-(const mint &a) const { mint res(*this); return res -= a; } mint operator*(const mint &a) const { mint res(*this); return res *= a; } mint operator/(const mint &a) const { mint res(*this); return res /= a; } friend std::ostream& operator<<(std::ostream &os, const mint &n) { return os << n.x; } bool operator==(const mint &a) const { return this->x == a.x; } }; int main() { int n,q;cin >> n >> q; vector a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } vector dp(n + 1,0); dp[0] = 1; for (int i = 0; i < n; i++) { for (int j = n; j >= 1; j--) { dp[j] += dp[j - 1] * (a[i] - 1); } } for (int i = 0; i < q; i++) { int b;cin >> b; cout << dp[n - b] << endl; } return 0; }