#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';
ll const mod = 998244353;

int main() {
    int n,q;
    cin >> n >> q;
    array<ll,6010> a,b;
    array<array<ll,6010>,2> dp;
    dp[0].fill(0);
    dp[0][0] = 1;
    for (int i = 0;i < n;++i) scanf("%d",&a[i]);
    for (int i = 0;i < q;++i) scanf("%d",&b[i]);
    for (int i = 0;i < n;++i) {
        dp[(i&1)^1].fill(0);
        for (int j = 0;j < n;++j) dp[(i&1)^1][j+1] = dp[i&1][j];
        for (int j = 0;j < n;++j) {
            (dp[(i&1)^1][j] += dp[i&1][j]*(a[i]-1)%mod) %= mod;
        }
    }
    for (int i = 0;i < q;++i) cout << dp[n&1][b[i]] << newl;
}