#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    int n, x, y; cin >> n >> x >> y;
    vector<bitset<18>> a(x), b(y);
    rep(i, x){
        int t; cin >> t;
        bitset<18> bs(t);
        a[i] = bs;
    }
    rep(i, y){
        int t; cin >> t;
        bitset<18> bs(t);
        b[i] = bs;
    }
    mint base = mint(1);
    mint ans = mint(0);
    rep(i, 18){
        vmi cnta(2), cntb(2);
        rep(j, x)cnta[a[j][i]]++;
        rep(j, y)cntb[b[j][i]]++;

        vvmi c(2, vmi(2));
        c[0][0] = mint(x)*cntb[0] + cnta[0]*cntb[1];
        c[0][1] = mint(x)*cntb[0];
        c[1][0] = cnta[1]*cntb[1];
        c[1][1] = mint(x)*cntb[1];
        vvmi d(2, vmi(2, 0)); d[0][0] = mint(1); d[1][1] = mint(1);
        rep(j, n){
            vvmi e(2, vmi(2, 0));
            rep(k, 2)rep(l, 2){
                rep(m, 2)e[k][l] += c[k][m]*d[m][l];
            }
            d = e;
        }
        ans += d[1][0]*base;
        base*=2;
    }
    cout << ans.val() << endl;

    return 0;
}