#include <stdio.h>

const int Mod = 998244353, bit[19] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144};

long long pow_mod(int n, long long k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

int main()
{
	int i, N, X, Y, A[262144], B[262144];
	scanf("%d %d %d", &N, &X, &Y);
	for (i = 1; i <= X; i++) scanf("%d", &(A[i]));
	for (i = 1; i <= Y; i++) scanf("%d", &(B[i]));
	
	int k, x, y;
	long long ans = 0, tmp;
	for (k = 0; k < 18; k++) {
		for (i = 1, x = 0; i <= X; i++) if ((A[i] & bit[k]) != 0) x++;
		for (i = 1, y = 0; i <= Y; i++) if ((B[i] & bit[k]) != 0) y++;
		if (x == 0 || y == 0) continue;
		for (i = 1, tmp = 0; i < N; i++) tmp += pow_mod(y, i) * pow_mod(Y, N - i - 1) % Mod * (pow_mod(X, N) - pow_mod(X, N - i) * pow_mod(X - x, i) % Mod + Mod) % Mod;
		tmp = (tmp % Mod * (Y - y) + pow_mod(y, N) * (pow_mod(X, N) - pow_mod(X - x, N) + Mod)) % Mod;
		ans += bit[k] * tmp % Mod;
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}