#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vvm matrix_mul(vvm A, vvm B) {
	vvm C(A.size(), vm(B[0].size()));
	rep(i, A.size()) {
		rep(k, B.size()) {
			rep(j, B[0].size()) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
vvm matrix_pow(vvm A, lint k) {
	vvm B(A.size(), vm(A.size()));
	rep(i, A.size()) B[i][i] = 1;
	while (k > 0) {
		if (k & (lint)1) B = matrix_mul(B, A);
		A = matrix_mul(A, A);
		k >>= 1;
	}
	return B;
}
int main() {
	lint N, X, Y;
	cin >> N >> X >> Y;
	vi v(X), w(Y);
	vin(v);
	vin(w);

	mint a=0, b=0, c=0, x, y, z;
	vi t(18), u(18);
	rep(i, X) {
		rep(j, 18) {
			if ((v[i]&(1<<j)) != 0) t[j]++;
		}
	}
	rep(i, Y) {
		rep(j, 18) {
			if ((w[i]&(1<<j)) != 0) u[j]++;
		}
	}
	rep(i, 18) {
		a = 0, b = 1;
		rep(j, N) {
			x = a*X + b*t[i];
			y = b*(X-t[i]);
			a = x*u[i];
			b = x*(Y-u[i]) + y*Y;
		}
		c += a*((lint)1<<i);
	}
	std::cout << c.val() << '\n';
}