#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N, M;
    cin >> N >> M;
    V<int> A(N), B(M);
    rep(i, N) cin >> A[i];
    rep(j, M) cin >> B[j];
    int ax = 0, bx = 0;
    rep(i, N) ax ^= A[i];
    rep(j, M) bx ^= B[j];
    if (ax == bx) {
        if (N == 1 || M == 1) {
            cout << 1 << '\n';
        } else {
            mint ans = 1 << 20;
            cout << ans.pow((N - 1) * (M - 1)).val() << '\n';
        }
    } else {
        cout << 0 << '\n';
    }
    return 0;
}