#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};




void solve(){
    ll N,X,Y;
    cin>>N>>X>>Y;
    ll ans=0;
    vector<ll>A(X),B(Y);
    rep(i,X)cin>>A[i];
    rep(i,Y)cin>>B[i];
    rep(k,18){
        ll cnt1=0,cnt2=0;
        rep(j,X){
            if((1<<k)&A[j])cnt1++;
        }
        rep(j,Y){
            if((1<<k)&B[j])cnt2++;
        }
        vector<vector<ll> >dp(N+1,vector<ll>(2));
        dp[0][0]=1;
        rep(i,N){
            ll res0=0,res1=0;
            res0=(dp[i][0]*cnt1%mod*(Y-cnt2)%mod+dp[i][0]*(X-cnt1)%mod*Y%mod+dp[i][1]*X%mod*(Y-cnt2)%mod)%mod;
            res1=(dp[i][0]*cnt1%mod*cnt2%mod+dp[i][1]*X%mod*cnt2%mod)%mod;
            dp[i+1][0]=res0;
            dp[i+1][1]=res1;
        }
        ans=(ans+(1LL<<k)*dp[N][1]%mod)%mod;
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}