#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;

const int mod = 998244353;

void add(int& u, int v) {
    u += v;
    if (u >= mod) u -= mod;
}

void sub(int& u, int v) {
    u -= v;
    if (u < 0) u += mod;
}

int power(int a, int b) {
    int res = 1;
    while (b) {
        if (b % 2) res = res * 1ll * a % mod;
        a = a * 1ll * a % mod;
        b /= 2;
    }
    return res;
}

int main() {
    int n, x, y;
    scanf("%d%d%d", &n, &x, &y);
    vector<long long> a(x);
    vector<long long> b(y);
    for (int i = 0; i < x; i++) scanf("%lld", &a[i]);
    for (int i = 0; i < y; i++) scanf("%lld", &b[i]);
    vector<int> px(n + 1, 1);
    vector<int> py(n + 1, 1);
    for (int i = 1; i <= n; i++) {
        px[i] = px[i - 1] * 1ll * x % mod;
        py[i] = py[i - 1] * 1ll * y % mod;
    }
    int ans = 0;
    for (int it = 0; it <= 60; it++) {
        long long bit = 1ll << it;
        int a0 = 0, a1 = 0;
        int b0 = 0, b1 = 0;
        for (int i = 0; i < x; i++) {
            if (a[i] & bit) a1++;
            else a0++;
        }
        for (int i = 0; i < y; i++) {
            if (b[i] & bit) b1++;
            else b0++;
        }
        vector<vector<int>> pw(n + 1, vector<int> (2, 1));
        for (int i = 1; i <= n; i++) {
            pw[i][0] = pw[i - 1][0] * 1ll * a0 % mod;
            pw[i][1] = pw[i - 1][1] * 1ll * b1 % mod;
        }
        for (int fst = 1; fst <= n; fst++) {
            int way = px[fst - 1] * 1ll * pw[n - fst][0] % mod * 1ll * a1 % mod;
            int mul = py[fst - 1] * 1ll * pw[n - fst + 1][1] % mod;
            int conb = bit % mod * 1ll * way % mod * 1ll * mul % mod;
            add(ans, conb);
        }
    }
    printf("%d\n", ans);
    return 0;
}