#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,X,Y;
int A[1<<20],B[1<<20];
const ll mo=998244353;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>X>>Y;
	FOR(i,X) cin>>A[i];
	FOR(i,Y) cin>>B[i];
	ll ret=0;
	FOR(i,18) {
		int C[2]={},D[2]={};
		FOR(j,X) C[(A[j]>>i)&1]++;
		FOR(j,Y) D[(B[j]>>i)&1]++;
		
		ll from[2]={1,0};
		FOR(j,N) {
			ll to[2]={};
			to[0]=from[0]*C[0]%mo;
			to[1]=(from[1]*C[0]+from[0]*C[1]+from[1]*C[1])%mo;
			from[1]=to[1]*D[1]%mo;
			from[0]=(to[1]*D[0]+to[0]*D[1]+to[0]*D[0])%mo;
		}
		
		ret+=(1<<i)*from[1]%mo;
		
	}
	cout<<ret%mo<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}