#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

constexpr ll mod = 998244353;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,x,y; cin >> n >> x >> y;
    vector<int> a(x),b(y);
    for(int i=0;i<x;i++){
        cin >> a[i];
    }
    for(int i=0;i<y;i++){
        cin >> b[i];
    }
    ll res = 0;
    for(int i=0;i<18;i++){
        array<ll, 2> dp;
        dp[0] = 1;
        dp[1] = 0;
        ll z = 0, o = 0;
        for(int j:a){
            if((1<<i)&j)o++;
            else z++;
        }
        ll zz = 0, oo = 0;
        for(int j:b){
            if((1<<i)&j)oo++;
            else zz++;
        }
        for(int j=0;j<n;j++){
            {
                array<ll, 2> ndp;
                ndp[1] = (dp[0]+dp[1])*o + dp[1]*z;
                ndp[1] %= mod;
                ndp[0] = dp[0]*z; 
                ndp[0] %= mod;
                swap(dp,ndp);
            }
            {
                array<ll, 2> ndp;
                ndp[1] = dp[1]*oo;
                ndp[1] %= mod;
                ndp[0] = (dp[0]+dp[1])*zz + dp[0]*oo;
                ndp[0] %= mod;
                swap(dp,ndp);
            }
        }
        res += dp[1] * (1LL<<i) % mod;
    }
    cout << res%mod << endl;
}