1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
const int mod=998244353;
const int g=3,gi=332748118,NR=1<<21;
ll n=1e6,k,a[(int)3e5+9],b[(int)3e5+9],q,c[(int)3e5+9],precn1[(int)3e5+9],po[(int)1e6+9],precn2[(int)3e5+9],ans[(int)3e5+9],bit,len;
int fac[(int)1e6+9],inv[(int)1e6+9];
int A[NR],B[NR],rev[NR];
int C(int n,int m){
if(m>n||n<0||m<0)return 0;
return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int powmod(int a,int b){
int res=1;
for(;b>0;b>>=1,a=1ll*a*a%mod)if(b&1)res=1ll*res*a%mod;
return res;
}
void NTT(int *a,int type){
for(int i=0;i<len;++i)if(rev[i]>i)swap(a[rev[i]],a[i]);
for(int k=1;k<len;k<<=1){
int wn=powmod(type==1?g:gi,(mod-1)/(k<<1));
for(int i=0;i<len;i+=(k<<1)){
int w=1;
for(int j=0;j<k;++j,w=1ll*w*wn%mod){
int x=a[i+j],y=1ll*a[i+j+k]*w%mod;
a[i+j]=(x+y)%mod,a[i+j+k]=(x-y+mod)%mod;
}
}
}
if(type==1)return;
int invn=powmod(len,mod-2);
for(int i=0;i<len;++i)a[i]=1ll*a[i]*invn%mod;
}
void solve(){
for(int i=1;i<=k;++i){
ll cn1=precn1[b[i]-1],cn2=precn2[b[i]-1];
len=1,bit=0;
while(len<(cn1+2ll*cn2+1ll))len<<=1,bit+=1;
for(int i=0;i<len;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(bit-1));
for(int i=0;i<len;++i)A[i]=C(cn1,i)*po[i]%mod,B[i]=C(2ll*cn2,i);
NTT(A,1),NTT(B,1);
for(int i=0;i<len;++i)A[i]=1ll*A[i]*B[i]%mod;
NTT(A,0);
for(int j=1;j<=q;++j){
ll sy=(c[j]-2)/2-b[i];
if(sy>=0&&sy<len){
ans[j]=(ans[j]+A[sy])%mod;
}
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
po[0]=fac[0]=inv[0]=1;
for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod,po[i]=2ll*po[i-1]%mod;
inv[n]=powmod(fac[n],mod-2);
for(int i=n-1;i;--i)inv[i]=1ll*inv[i+1]*(i+1)%mod;
cin>>n>>k;
for(int i=1,x;i<=n;++i)cin>>x,a[x]+=1;
for(int i=1;i<=3e5;++i)precn1[i]=precn1[i-1]+(a[i]==1),precn2[i]=precn2[i-1]+(a[i]>1);
for(int i=1;i<=k;++i)cin>>b[i];
cin>>q;
for(int i=1;i<=q;++i)cin>>c[i];
solve();
for(int i=1;i<=q;++i)cout<<ans[i]<<"\n";
return 0;
}
|