#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <functional>
#define DB puts("D")
#define pb push_back

using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldINF = 1e18; const double EPS = 1e-6;
template<typename T, typename U, typename O> void caut(T a, U b, O c){cout<<"("<<a<<","<<b<<","<<c<<") ";}
template<typename T, typename U> void caut(T a, U b){cout<<"("<<a<<","<<b<<") ";}
template<typename T> void caut(T a){cout<<"("<<a<<") ";}
template<typename T> void input(T a[], int n){for(int i=0;i<n;i++) cin>>a[i];}
template<typename T, typename U> void input(T a[], U b[], int n){for(int i=0;i<n;i++) cin>>a[i]>>b[i];}
template<typename T, typename U, typename O> void input(T a[], U b[], O[], int n){for(int i=0;i<n;i++) cin>>a[i]>>b[i];}

using P=pair<double,int>;
const ll M = 998244353;

int main() {
  int n,q; cin>>n>>q;
  ll p[n+1][n+1]; fill(p[0],p[n+1],0LL); p[0][0]=1;
  ll a[n],b[q]; input(a,n); input(b,q);
  for(int i=0;i<n;i++) {
    for(int j=0;j<n;j++) {
      p[i+1][j] += p[i][j];
      p[i+1][j+1] += p[i][j] * (a[i]-1);
      p[i+1][j] %= M;
      p[i+1][j+1] %= M;
    }
  }
  for(int i=0;i<q;i++) {
    cout<<p[n][n-b[i]]<<endl;
  }
}