#include using namespace std; #define ALL(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<bool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b ostream &operator<<(ostream &os,const pair&p){ os< ostream &operator<<(ostream &os,const vector&v){ for(int i=0;i<(int)v.size();i++) os< istream &operator>>(istream &is,pair&p){ is>>p.first>>p.second; return is; } template istream &operator>>(istream &is,vector&v){ for(T &x:v)is>>x; return is; } template struct ModInt{ long long x; ModInt():x(0){} ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){} ModInt &operator+=(const ModInt &p){ if((x+=p.x)>=Mod) x-=Mod; return *this; } ModInt &operator-=(const ModInt &p){ if((x+=Mod-p.x)>=Mod)x-=Mod; return *this; } ModInt &operator*=(const ModInt &p){ x=(int)(1ll*x*p.x%Mod); return *this; } ModInt &operator/=(const ModInt &p){ (*this)*=p.inverse(); return *this; } ModInt operator-()const{return ModInt(-x);} ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;} ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;} ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;} ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;} ModInt operator==(const ModInt &p)const{return x==p.x;} ModInt operator!=(const ModInt &p)const{return x!=p.x;} ModInt inverse()const{ int a=x,b=Mod,u=1,v=0,t; while(b>0){ t=a/b; swap(a-=t*b,b);swap(u-=t*v,v); } return ModInt(u); } ModInt pow(long long n)const{ ModInt ret(1),mul(x); while(n>0){ if(n&1) ret*=mul; mul*=mul;n>>=1; } return ret; } friend ostream &operator<<(ostream &os,const ModInt &p){return os<>(istream &is,ModInt &a){long long t;is>>t;a=ModInt(t);return (is);} static int get_mod(){return Mod;} }; using mint=ModInt; template struct comcalc{ vector fact,finv,inv; comcalc():fact(MAX),finv(MAX),inv(MAX){ fact[0]=mint(1),fact[1]=mint(1),finv[0]=mint(1),finv[1]=mint(1),inv[1]=mint(1); for(int i=2;ir)return mint(0); mint ret=mint(r+1)*com(n+r+1,r+1)-mint(l)*com(l+n,l); ret/=mint(n+1); return ret; } }; mint pow_mod(mint x,ll n){ return x.pow(n); } mint inv_mod(mint x){ return x.inverse(); } // O(n) mint fact_mod(ll n){ mint ret=1; for(int i=2;i<=n;i++) ret*=mint(i); return ret; } // O(r) mint comb_mod(ll n,ll r){ if(r>n-r) r=n-r; if(r==0) return 1; mint a=1,b=mint(fact_mod(r)).inverse(); for(int i=0;i; struct NTTmodint{ vector dw,idw; int max_base; mint root; NTTmodint(){ ll tmp=mod-1; max_base=0; while(tmp%2==0) tmp>>=1,max_base++; root=2; while(root.pow((mod-1)>>1).x==1) root+=1; dw.resize(max_base);idw.resize(max_base); for(int i=0;i>(i+2)); idw[i]=mint(1)/dw[i]; } } void ntt(vector &a){ int n=(int)a.size(); for(int m=n;m>>=1;){ mint w=1; for(int s=0,k=0;s &a,bool f=true){ int n=(int)a.size(); for(int m=1;m multiply(vector a,vector b){ int need=(int)a.size()+b.size()-1; int nbase=1; while((1<>n>>k; vector a(n); cin>>a; vector> fs(n); rep(i,n)fs[i]={a[i]-1,1}; priority_queue> que; rep(i,n) que.push({2,i}); while(que.size()>1){ auto [_ ,u]=que.top();que.pop(); auto [__,v]=que.top();que.pop(); fs[u]=ntt.multiply(fs[u],fs[v]); que.push({fs[u].size(),u}); } auto [_,u]=que.top(); auto &res=fs[u]; while(k--){ int b;cin>>b; cout<