#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
vector<vector<long long>> matmul(vector<vector<long long>> A, vector<vector<long long>> B){
	int N = A.size();
	vector<vector<long long>> ans(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			for (int k = 0; k < N; k++){
				ans[i][k] += A[i][j] * B[j][k];
				ans[i][k] %= MOD;
			}
		}
	}
	return ans;
}
vector<vector<long long>> matexp(vector<vector<long long>> A, long long b){
	int N = A.size();
	vector<vector<long long>> ans(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++){
		ans[i][i] = 1;
	}
	while (b > 0){
		if (b % 2 == 1){
			ans = matmul(ans, A);
		}
		A = matmul(A, A);
		b /= 2;
	}
	return ans;
}
int main(){
  int N, X, Y;
  cin >> N >> X >> Y;
  vector<int> A(X);
  for (int i = 0; i < X; i++){
    cin >> A[i];
  }
  vector<int> B(Y);
  for (int i = 0; i < Y; i++){
    cin >> B[i];
  }
  long long ans = 0;
  for (int i = 0; i < 18; i++){
    long long cnt1 = 0;
    for (int j = 0; j < X; j++){
      if ((A[j] >> i & 1) == 1){
        cnt1++;
      }
    }
    long long cnt0 = 0;
    for (int j = 0; j < Y; j++){
      if ((B[j] >> i & 1) == 0){
        cnt0++;
      }
    }
    vector<vector<long long>> M(2, vector<long long>(2));
    M[0][0] = (cnt1 * cnt0 + (X - cnt1) * Y) % MOD;
    M[0][1] = cnt1 * (Y - cnt0) % MOD;
    M[1][0] = (cnt1 * cnt0 + (X - cnt1) * cnt0) % MOD;
    M[1][1] = (cnt1 * (Y - cnt0) + (X - cnt1) * (Y - cnt0)) % MOD;
    M = matexp(M, N);
    ans += (1 << i) * M[0][1] % MOD;
  }
  ans %= MOD;
  cout << ans << endl;
}