#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int nx(int cur, int s){
    if(cur == 1 || (s&2) > 0){
        cur = 1;
    }
    cur &= s;
    return cur;
}

mint sub_solve(mint p, mint q, int n){
    auto dp = vec2d(n+1, 2, mint(0));
    dp[0][0] = 1;
    vector<mint> proba(4);
    proba[0] = (mint(1)-mint(p))*(mint(1)-mint(q));
    proba[1] = (mint(1)-mint(p))*mint(q);
    proba[2] = mint(p)*(mint(1)-mint(q));
    proba[3] = mint(p)*mint(q);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 2; j++){
            for(int s = 0; s < 4; s++){
                dp[i+1][nx(j, s)] += dp[i][j]*proba[s];
            }
        }
    }
    return dp[n][1];
}

mint pow(mint a, ll n) {
    assert(n >= 0);
	mint ans = 1;
    while (n > 0) {
        if (n&1) ans = ans*a;
        a = a*a;
        n >>= 1;
    }
	return ans;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    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];
    mint x_inv = mint(x).inv();
    mint y_inv = mint(y).inv();
    mint ans = 0;
    mint pw = pow(mint(x)*mint(y), n);
    for(int i = 0; i < 18; i++){
        mint p = 0, q = 0;
        for(int j = 0; j < x; j++) {
            if(a[j]&(1<<i)) p += x_inv;
        }
        for(int j = 0; j < y; j++) {
            if(b[j]&(1<<i)) q += y_inv;
        }
        ans += sub_solve(p, q, n)*(1<<i);
    }
    ans *= pw;
    cout << ans << endl;
}