using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var a = NList;
        var b = NList;
        if (n > m)
        {
            (n, m) = (m, n);
            (a, b) = (b, a);
        }
        var ans = 1L;
        var mod = 998_244_353;
        var ncr = new NCR(m, mod);
        var even = 0L;
        var odd = 0L;
        for (var j = 0; j <= m; ++j)
        {
            if (j % 2 == 0) even = (even + ncr.Calc(m, j)) % mod;
            else odd = (odd + ncr.Calc(m, j)) % mod;
        }
        for (var i = 0; i < 20; ++i)
        {
            var vsum = 0;
            foreach (var ai in a) vsum ^= (ai >> i) & 1;
            var hsum = 0;
            foreach (var bi in b) hsum ^= (bi >> i) & 1;
            if (vsum != hsum)
            {
                WriteLine(0);
                return;
            }
            for (var j = 1; j < n; ++j)
            {
                if (((a[j] >> i) & 1) == 0) ans = ans * even % mod;
                else ans = ans * odd % mod;
            }
        }
        WriteLine(ans);
    }
    class NCR
    {
        int[] facts;
        int[] revFacts;
        int mod;
        public NCR(int n, int mod)
        {
            facts = new int[n + 1];
            revFacts = new int[n + 1];
            this.mod = mod;
            facts[0] = 1;
            var tmp = 1L;
            for (var i = 1; i <= n; ++i)
            {
                tmp = (tmp * i) % mod;
                facts[i] = (int)tmp;
            }
            tmp = Exp(facts[n], mod - 2);
            revFacts[n] = (int)tmp;
            for (var i = n; i > 1; --i)
            {
                tmp = (tmp * i) % mod;
                revFacts[i - 1] = (int)tmp;
            }
            revFacts[0] = 1;
        }
        public long Exp(long n, long k)
        {
            n = n % mod;
            if (k == 0) return 1;
            if (k == 1) return n;
            var half = Exp(n, k / 2);
            var result = (half * half) % mod;
            return ((k % 2) == 0) ? result : ((result * n) % mod);
        }
        public long Calc(int n, int r)
        {
            return (long)facts[n] * revFacts[r] % mod * revFacts[n - r] % mod;
        }
        /// <summary>nが大きくrが小さい場合の計算</summary>
        public long Calc2(int n, int r)
        {
            var tmp = 1L;
            for (var i = 0; i < r; ++i)
            {
                tmp = tmp * (n - i) % mod;
            }
            return tmp * revFacts[r] % mod;
        }
        public long NPR(int n, int r)
        {
            return (long)facts[n] * revFacts[r] % mod;
        }
        public long Fact(int n)
        {
            return facts[n];
        }
        public long RevFact(int n)
        {
            return revFacts[n];
        }
    }
}