func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC optimize( unroll-loops )   #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native )   using namespace std;   const long long N = 1 << 20 | 1, M = 998244353;   long long a[N], Ans[N], n, m, x, cnt[N], b[N], Q, wn[N], rev[N], w[N];   inline long long ksm(long long x, long long y) {     long long ans = 1;     for (; y; y >>= 1, x = x * x % M)       if (y & 1) ans = ans * x % M;     return ans;   }   inline void init(long long len) {     for (long long i = 1; i < len; i++)       rev[i] = rev[i >> 1] >> 1 | ((i & 1) * len / 2);   }   inline void reduce(long long &x) { x += x >> 31 & M; }   inline void ntt(long long y[], long long len, long long opt) {     for (long long i = 1; i < len; i++)       if (rev[i] > i) swap(y[i], y[rev[i]]);     for (long long h = 1; h < len; h <<= 1)       for (long long j = 0; j < len; j += h + h)         for (long long k = 0; k < h; ++k) {           const long long x = y[h + j + k] * w[h + k] % M;           reduce(y[h + j + k] = y[j + k] - x);           reduce(y[j + k] += x - M);         }     if (opt == -1) {       long long temp = ksm(len, M - 2);       for (long long i = 0; i < len; i++) y[i] = y[i] * temp % M;       reverse(y + 1, y + len);     }   }   inline void solve(long long l, long long r, long long a[]) {     if (l > r) {       a[0] = 1;       return;     }     if (l == r) {       a[0] = 1;       if (cnt[l] > 0) a[1] = 2;       if (cnt[l] > 1) a[2] = 1;       return;     }     long long len = 1;     while (len <= b[r] - b[l - 1]) len <<= 1;     long long mid = (l + r) / 2, b[len], c[len];     memset(b, 0, sizeof b);     memset(c, 0, sizeof c);     solve(l, mid, b);     solve(mid + 1, r, c);     init(len);     ntt(b, len, 1);     ntt(c, len, 1);     for (long long i = 0; i < len; i++) a[i] = b[i] * c[i] % M;     ntt(a, len, -1);   }   inline long long read() {     long long x = 0;     char c = 0;     for (; c <  0  || c >  9 ; c = getchar())       ;     for (; c >=  0  && c <=  9 ; c = getchar()) x = x * 10 + c - 48;     return x;   }   signed main() {     n = read();     m = read();     for (long long i = 1; i <= n; i++) cnt[read()]++;     ;     for (long long i = 1; i <= 300000; i++) b[i] = b[i - 1] + min(cnt[i], 2ll);     long long len = 1;     while (len <= 300000) len <<= 1;     for (long long mid = 1; mid < len; mid <<= 1) {       const long long wn = ksm(3, M / mid / 2);       w[mid] = 1;       for (long long i = 1; i < mid; ++i) w[i + mid] = w[i + mid - 1] * wn % M;     }     while (m--) {       scanf( %lld , &x);       memset(a, 0, sizeof a);       solve(1, x - 1, a);       for (long long i = 0; i <= 300000; i++) (Ans[i + x + 1] += a[i]) %= M;     }     Q = read();     while (Q--) {       x = read();       printf( %lld n , Ans[x / 2]);     }   }   