#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll MOD = 998244353;
    ll n, q;
    cin >> n >> q;
    ll a[n], b[q];
    rep(i,n)cin >> a[i];
    rep(i,q)cin >> b[i];

    ll dp[2][n+10];
    rep(i,2)rep(j,n+10)dp[i][j] = 0;

    rep(i,n){
        if(i == 0){
            dp[1][0] = a[i] - 1;
            dp[1][1] = 1;
        }else{
            rep(j,n+1){
                dp[1][j+1] = dp[0][j];
                if(j == 0){
                    dp[1][j] = (dp[1-1][j]*(a[i]-1)%MOD) % MOD;
                }else{
                    dp[1][j] = (dp[1-1][j]*(a[i]-1)%MOD + dp[1-1][j-1]) % MOD;
                }   
                
            }
        }
        rep(j,n+10){
            dp[0][j] = dp[1][j];
            dp[1][j] = 0;
        }
    }

    rep(i,q){
        cout << dp[1-1][b[i]] << endl;
    }

    return 0;
}