#include <bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll= long long;
ll mod=998244353;
ll modpow(ll x, ll n) {
  x = x%mod;
  if(n==0) return 1;  //再帰の終了条件

  else if(n%2==1) {
    return (x*modpow(x, n-1))%mod;  //nが奇数ならnを1ずらす
  }
  else return modpow((x*x)%mod, n/2)%mod;  //nが偶数ならnが半分になる
}
int main(){
    ll n,m;
    cin >> n >> m;
    vector<ll>a(n),b(m);
    ll x=0;
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
        x^=a[i];
    }
    for (ll i = 0; i < m; i++)
    {
        cin >> b[i];
        x^=b[i];
    }
    if (x!=0)
    {
        cout << 0 << endl;
        return 0;
    }
    cout << modpow(2,(n-1)*(m-1)*20) << endl;
}