#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
typedef long long ll;

vector<ll> bitconversion(ll i, ll n, ll N)
{
    //数字iをn進数にして，長さNの配列にして返す。
    //例えば，bitconversion(33,3,4)={1,0,2,0}。
    ll x = 1;
    rep(j, N)
    {
        x *= n;
    }
    vector<ll> vec(N);
    rep(j, N)
    {
        x /= n;
        vec[j] = i / x;
        i -= x * vec[j];
    }
    return vec;
}


int main(){
    ll N,X,Y;
    cin >> N >> X >> Y;
    vector<ll> A(X);
    vector<ll> B(Y);
    rep(i,X) cin >> A[i];
    rep(i,Y) cin >> B[i];

    vector<ll> bit_standa(18, 0);
    vector<ll> bit_standb(18, 0);

    for (ll i = 0; i < X; i++){
        vector<ll> bin = bitconversion(A[i], 2, 18);
        for (ll j = 0; j < 18; j++){
            bit_standa[j] += bin[j];
        }
    }
    for (ll i = 0; i < Y; i++){
        vector<ll> bin = bitconversion(B[i], 2, 18);
        for (ll j = 0; j < 18; j++){
            bit_standb[j] += bin[j];
        }
    }

    vector<vector<ll>> dp1(18, vector<ll>(N + 1, 0));//bitが立っている．
    vector<vector<ll>> dp2(18, vector<ll>(N + 1, 0));//bitが立っていない．
    vector<vector<ll>> dp3(18, vector<ll>(N + 1, 0));//bitが立っている．
    vector<vector<ll>> dp4(18, vector<ll>(N + 1, 0));//bitが立っていない．
    for (ll i = 0; i < 18; i++){
        dp2[i][0] = 1;
    }

    for (ll i = 0; i < 18; i++){
        for (ll j = 0; j < N; j++){
            dp3[i][j] = (dp3[i][j] + dp1[i][j] * X) % mod2;
            dp3[i][j] = (dp3[i][j] + dp2[i][j] * bit_standa[i]) % mod2;
            dp4[i][j] = (dp4[i][j] + dp2[i][j] * (X - bit_standa[i])) % mod2;

            dp1[i][j + 1] = (dp1[i][j + 1] + dp3[i][j] * bit_standb[i]) % mod2;
            dp2[i][j + 1] = (dp2[i][j + 1] + dp3[i][j] * (Y - bit_standb[i])) % mod2;
            dp2[i][j + 1] = (dp2[i][j + 1] + dp4[i][j] * Y) % mod2;
        }
    }
    vector<ll> pow_2(18);
    pow_2[0] = 1;
    for (ll i = 0; i < 17; i++){
        pow_2[i + 1] = pow_2[i] * 2;
    }
    ll ans = 0;
    for (ll i = 0; i < 18; i++){
        ans = (ans + dp1[i][N] * pow_2[17 - i]) % mod2;
    }
    cout << ans << endl;
}