#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

const int MOD=998244353;
vector<vector<ll>> matrixmul(ll m,vector<vector<ll>> a,vector<vector<ll>> b){
  vector<vector<ll>> c(m,vector<ll>(m,0)); //c:和の単位元
  rep(i,m) rep(j,m) rep(k,m) c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
  return c;
}

vector<vector<ll>> matrixpow(ll m,vector<vector<ll>> vec,ll n){
  vector<vector<ll>> ans(m,vector<ll>(m,0));
  rep(i,m) ans[i][i]=1; //ans:積の単位元
  while(n){
    if(n&1) ans=matrixmul(m,ans,vec);
    vec=matrixmul(m,vec,vec);
    n>>=1;
  }
  return ans;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,x,y;
  cin>>n>>x>>y;
  vector<ll> A(x),B(y);
  rep(i,x) cin>>A[i];
  rep(i,y) cin>>B[i];
  
  ll t=1,ans=0;
  rep(k,18){
    ll b=0,d=0;
    rep(i,x) if(A[i]&(1LL<<k)) b++;
    rep(i,y) if(B[i]&(1LL<<k)) d++;
    ll a=x-b,c=y-d;
    vector<vector<ll>> C(2,vector<ll>(2));
    C[0][0]=((a*c%MOD+a*d%MOD)%MOD+b*c%MOD)%MOD,C[0][1]=(a*c%MOD+b*c%MOD)%MOD;
    C[1][0]=b*d%MOD,C[1][1]=(a*d%MOD+b*d%MOD)%MOD;
    vector<vector<ll>> D=matrixpow(2,C,n);
    ans=(ans+t*D[1][0]%MOD)%MOD;
    t*=2; 
  }
  cout<<ans<<endl;
    
  return 0;
}