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

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    int N, M, Asum = 0, Bsum = 0;
    cin >> N >> M;
    VI A(N), B(M);
    REP(i, N) {
        cin >> A[i];
        Asum ^= A[i];
    }
    REP(i, M) {
        cin >> B[i];
        Bsum ^= B[i];
    }
    if (Asum != Bsum) {
        cout << "0\n";
        return 0;
    }
    cout << mod_pow(1LL << 20, 1LL * (N - 1) * (M - 1), MOD) << "\n";
}