#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

const ll MOD = 998244353;
int N, Q;
ll A[10000], B[10000]; 

ll dp[2][6005];

void init(){
    dp[0][0] = 1;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j <= N; j++){
            dp[i%2][j] = 0;
        }
        for(int j = 0; j <= i-1; j++){
            // 1
            dp[i%2][(j+1)] += dp[(i-1)%2][j];
            dp[i%2][(j+1)] %= MOD;
            // 1 以外
            dp[i%2][j] += dp[(i-1)%2][j]*(A[i-1]-1);
            dp[i%2][j] %= MOD;
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> Q;
    for(int i = 0; i < N; i++) cin >> A[i];
    for(int i = 0; i < Q; i++) cin >> B[i];
    init();
    
    for(int i = 0; i < Q; i++){
        cout << dp[N%2][B[i]] << endl;
    }
}