#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>

using namespace std;

long long mod_exp(long long b, long long e, long long m){
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b*b) % m;
    }

    return ans;
}

const long long modc = 998244353;

int main(){
    
    long long N, M, a, b, A=0, B=0;
    cin >> N >> M;
    for (int i=0; i<N; i++){
        cin >> a;
        A ^= a;
    }
    for (int i=0; i<M; i++){
        cin >> b;
        B ^= b;
    }

    if (A == B) cout << mod_exp(2, (N-1)*(M-1)*20, modc) << endl;
    else cout << 0 << endl;

    return 0;
}