def solve(N,X,Y,A,B): mu=max(max(A), max(B)).bit_length() Ans=0; Mod=998244353 for d in range(mu): S=[0,0]; T=[0,0] for i in range(X): S[A[i]&1]+=1 A[i]>>=1 for j in range(Y): T[B[j]&1]+=1 B[j]>>=1 DP=[1,0] for _ in range(N): E=DP; DP=[0,0] for r in [0,1]: for p,q in [[0,0], [0,1], [1,0], [1,1]]: DP[(r|p)&q]+=S[p]*T[q]*E[r] DP=[t%Mod for t in DP] Ans+=DP[1]*(1<