#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; using vc = pair>; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 998244353; int main(){ int n,q; cin >> n >> q; vector a(n),b(q); rep(i,n) cin >> a[i]; rep(i,q) cin >> b[i]; vector dp(n+1,0); dp[0] = 1; for(int i=1;i<=n;i++){ for(int j=n;j>=0;j--){ if(j > 0) dp[j] = ((dp[j]*(a[i-1]-1))%MOD + dp[j-1])%MOD; else dp[j] = (dp[j]*(a[i-1]-1))%MOD; } } rep(i,q){ cout << dp[b[i]] << '\n' ; } return 0; }