#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<vector<mint>> mul(vector<vector<mint>>&A, vector<vector<mint>>&B) {
	vector<vector<mint>> C(A.size(), vector<mint>(B[0].size()));
	rep(i, A.size()) rep(j, B[0].size()) rep(k, A[0].size()) C[i][j] += A[i][k] * B[k][j];
	return C;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, x, y; cin >> n >> x >> y;
	vector<int>a(x), b(y);
	rep(i, x)cin >> a[i];
	rep(i, y)cin >> b[i];
	mint ans = 0;
	rep(i, 20) {
		vector<vector<mint>> mor(2, vector<mint>(2));
		vector<vector<mint>> mand(2, vector<mint>(2));
		rep(j, x) {
			if (1 & (a[j] >> i)) mor[1][0]++, mor[1][1]++;
			else mor[0][0]++, mor[1][1]++;
		}
		rep(j, y) {
			if (1 & (b[j] >> i)) mand[0][0]++, mand[1][1]++;
			else mand[0][0]++, mand[0][1]++;
		}
		auto mpow = mul(mand, mor);
		vector<vector<mint>> mans(2, vector<mint>(2));
		rep(i, 2)mans[i][i] = 1;
		int copyn = n;
		while (copyn) {
			if (1 == copyn % 2) mans = mul(mpow, mans);
			copyn /= 2;
			mpow = mul(mpow, mpow);
		}
		ans += mans[1][0] * pow_mod(2, i, mod);
	}
	cout << ans.val() << endl;
	return 0;
}