/* preprocessor start */
#ifdef LOCAL
    #define _GLIBCXX_DEBUG  // gcc
    #define _LIBCPP_DEBUG 0 // clang
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
    // #define _GLIBCXX_DEBUG
    // #define _LIBCPP_DEBUG 0
    // #define NDEBUG
#endif
// #define __buffer_check__
#define __precision__ 10
#define iostream_untie true
#define debug_stream std::cerr
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
#define odd(n) ((n) & 1)
#define even(n) (not __odd(n))
#define __popcount(n) __builtin_popcountll(n)
#define __clz32(n) __builtin_clz(n)
#define __clz64(n) __builtin_clzll(n)
#define __ctz32(n) __builtin_ctz(n)
#define __ctz64(n) __builtin_ctzll(n)
/* preprocessor end */

namespace setting
{
    using namespace std::chrono;
    system_clock::time_point start_time, end_time;
    long long get_elapsed_time() { end_time = system_clock::now(); return duration_cast<milliseconds>(end_time - start_time).count(); }
    void print_elapsed_time() { debug_stream << "\n----- Exec time : " << get_elapsed_time() << " ms -----\n"; }
    void buffer_check() { char bufc; if(std::cin >> bufc) debug_stream << "\n\033[1;35mwarning\033[0m: buffer not empty.\n"; }
    struct setupper
    {
        setupper()
        {
            if(iostream_untie) std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
            std::cout << std::fixed << std::setprecision(__precision__);
    #ifdef stderr_path
            if(freopen(stderr_path, "a", stderr))
            {
                std::cerr << std::fixed << std::setprecision(__precision__);
            }
    #endif
    #ifdef stdout_path
            if(not freopen(stdout_path, "w", stdout))
            {
                freopen("CON", "w", stdout);
                debug_stream << "\n\033[1;35mwarning\033[0m: failed to open stdout file.\n";
            }
            std::cout << "";
    #endif
    #ifdef stdin_path
            if(not freopen(stdin_path, "r", stdin))
            {
                freopen("CON", "r", stdin);
                debug_stream << "\n\033[1;35mwarning\033[0m: failed to open stdin file.\n";
            }
    #endif
    #ifdef LOCAL
            debug_stream << "\n----- stderr at LOCAL -----\n\n";
            atexit(print_elapsed_time);
    #endif
    #ifdef __buffer_check__
            atexit(buffer_check);
    #endif
    #if defined(__clock__) || defined(LOCAL)
            start_time = system_clock::now();
    #endif
        }
    } __setupper; // struct setupper
} // namespace setting
#ifdef __clock__
class
{
    std::chrono::system_clock::time_point built_pt, last_pt; int built_ln, last_ln;
    std::string built_func, last_func; bool is_built = false;
public:
    void build(int crt_ln, const std::string &crt_func)
    {
        is_built = true, last_pt = built_pt = std::chrono::system_clock::now(), last_ln = built_ln = crt_ln, last_func = built_func = crt_func;
    }
    void set(int crt_ln, const std::string &crt_func)
    {
        if(is_built) last_pt = std::chrono::system_clock::now(), last_ln = crt_ln, last_func = crt_func;
        else debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::set failed (yet to be built!)\n";
    }
    void get(int crt_ln, const std::string &crt_func)
    {
        if(is_built)
        {
            std::chrono::system_clock::time_point crt_pt(std::chrono::system_clock::now());
            long long diff = std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt - last_pt).count();
            debug_stream << diff << " ms elapsed from" << " [ " << last_ln << " : " << last_func << " ]";
            if(last_ln == built_ln) debug_stream << " (when built)";
            debug_stream << " to" << " [ " << crt_ln << " : " << crt_func << " ]" << "\n";
            last_pt = built_pt, last_ln = built_ln, last_func = built_func;
        }
        else
        {
            debug_stream << "[ " << crt_ln << " : " << crt_func << " ] " << "myclock_t::get failed (yet to be built!)\n";
        }
    }
} myclock; // unnamed class
    #define build_clock() myclock.build(__LINE__, __func__)
    #define set_clock() myclock.set(__LINE__, __func__)
    #define get_clock() myclock.get(__LINE__, __func__)
#else
    #define build_clock() ((void)0)
    #define set_clock() ((void)0)
    #define get_clock() ((void)0)
#endif

namespace std
{
    // hash
    template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }
    template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } };
    template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } };
    template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } };
    // iostream
    template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; }
    template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; }
    template <class tuple_t, size_t index> struct tupleis { static istream &apply(istream &is, tuple_t &t) { tupleis<tuple_t, index - 1>::apply(is, t); return is >> get<index>(t); } };
    template <class tuple_t> struct tupleis<tuple_t, SIZE_MAX> { static istream &apply(istream &is, tuple_t &t) { return is; } };
    template <class... T> istream &operator>>(istream &is, tuple<T...> &t) { return tupleis<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is, t); }
    template <> istream &operator>>(istream &is, tuple<> &t) { return is; }
    template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } };
    template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } };
    template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); }
    template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; }
    template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>
    istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; }
    template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr>
    ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; }
} // namespace std

/* dump definition start */
#ifdef LOCAL
    #define dump(...) debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n", dump_func(#__VA_ARGS__, __VA_ARGS__)
    template <class T> void dump_func(const char *ptr, const T &x)
    {
        debug_stream << '\t';
        for(char c = *ptr; c != '\0'; c = *++ptr) if(c != ' ' && c != '\t') debug_stream << c;
        debug_stream << " : " << x << '\n';
    }
    template <class T, class... rest_t> void dump_func(const char *ptr, const T &x, rest_t... rest)
    {
        debug_stream << '\t';
        for(char c = *ptr; c != ','; c = *++ptr) if(c != ' ' && c != '\t') debug_stream << c;
        debug_stream << " : " << x << ",\n"; dump_func(++ptr, rest...);
    }
#else
    #define dump(...) ((void)0)
#endif
/* dump definition end */

/* function utility start */
template <class T, class... types> T read(types... args) noexcept { T obj(args...); std::cin >> obj; return obj; }
#define input(type, var, ...) type var{read<type>(__VA_ARGS__)}
// substitute y for x if x > y.
template <class T> inline bool sbmin(T &x, const T &y) { return x > y ? x = y, true : false; }
// substitute y for x if x < y.
template <class T> inline bool sbmax(T &x, const T &y) { return x < y ? x = y, true : false; }
// binary search on discrete range.
template <class iter_type, class pred_type>
iter_type binary(iter_type __ok, iter_type __ng, pred_type pred)
{
    std::ptrdiff_t dist(__ng - __ok);
    while(abs(dist) > 1)
    {
        iter_type mid(__ok + dist / 2);
        if(pred(mid)) __ok = mid, dist -= dist / 2;
        else __ng = mid, dist /= 2;
    }
    return __ok;
}
// binary search on real numbers.
template <class pred_type>
long double binary(long double __ok, long double __ng, const long double eps, pred_type pred)
{
    while(abs(__ok - __ng) > eps)
    {
        long double mid{(__ok + __ng) / 2};
        (pred(mid) ? __ok : __ng) = mid;
    }
    return __ok;
}
// reset all bits.
template <class A> void reset(A &array) { memset(array, 0, sizeof(array)); }
// be careful that val is type-sensitive.
template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }
/* functon utility end */

/* using alias start */
using namespace std;
using i32 = int_least32_t; using i64 = int_least64_t; using u32 = uint_least32_t; using u64 = uint_least64_t;
using pii = pair<i32, i32>; using pll = pair<i64, i64>;
template <class T> using heap = priority_queue<T>;
template <class T> using rheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using hashset = unordered_set<T>;
template <class Key, class Value> using hashmap = unordered_map<Key, Value>;
/* using alias end */

/* library start */

#ifndef Modint_hpp
#define Modint_hpp
#include <cassert>
#include <iostream>

template <int mod>
class modint
{
    int val;
public:
    constexpr modint() noexcept : val{0} {}
    constexpr modint(long long x) noexcept : val((x %= mod) < 0 ? mod + x : x) {}
    constexpr long long value() const noexcept { return val; }
    constexpr modint operator++(int) noexcept { modint t = *this; return ++val, t; }
    constexpr modint operator--(int) noexcept { modint t = *this; return --val, t; }
    constexpr modint &operator++() noexcept { return ++val, *this; }
    constexpr modint &operator--() noexcept { return --val, *this; }
    constexpr modint operator-() const noexcept { return modint(-val); }
    constexpr modint &operator+=(const modint &other) noexcept { return (val += other.val) < mod ? 0 : val -= mod, *this; }
    constexpr modint &operator-=(const modint &other) noexcept { return (val += mod - other.val) < mod ? 0 : val -= mod, *this; }
    constexpr modint &operator*=(const modint &other) noexcept { return val = (long long)val * other.val % mod, *this; }
    constexpr modint &operator/=(const modint &other) noexcept { return *this *= inverse(other); }
    constexpr modint operator+(const modint &other) const noexcept { return modint(*this) += other; }
    constexpr modint operator-(const modint &other) const noexcept { return modint(*this) -= other; }
    constexpr modint operator*(const modint &other) const noexcept { return modint(*this) *= other; }
    constexpr modint operator/(const modint &other) const noexcept { return modint(*this) /= other; }
    constexpr bool operator==(const modint &other) const noexcept { return val == other.val; }
    constexpr bool operator!=(const modint &other) const noexcept { return val != other.val; }
    constexpr bool operator!() const noexcept { return !val; }
    friend constexpr modint operator+(long long x, modint y) noexcept { return modint(x) + y; }
    friend constexpr modint operator-(long long x, modint y) noexcept { return modint(x) - y; }
    friend constexpr modint operator*(long long x, modint y) noexcept { return modint(x) * y; }
    friend constexpr modint operator/(long long x, modint y) noexcept { return modint(x) / y; }
    static constexpr modint inverse(const modint &other) noexcept
    {
        assert(other != 0);
        int a{mod}, b{other.val}, u{}, v{1}, t{};
        while(b) t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v;
        return {u};
    }
    static constexpr modint pow(modint other, long long e) noexcept
    {
        if(e < 0) e = e % (mod - 1) + mod - 1;
        modint res{1};
        while(e) { if(e & 1) res *= other; other *= other, e >>= 1; }
        return res;
    }
    friend std::ostream &operator<<(std::ostream &os, const modint &other) noexcept { return os << other.val; }
    friend std::istream &operator>>(std::istream &is, modint &other) noexcept { long long val; other = {(is >> val, val)}; return is; }
}; // class modint

template <>
class modint<2>
{
    bool val;
public:
    constexpr modint(bool x = false) noexcept : val{x} {}
    constexpr modint(int x) noexcept : val(x & 1) {}
    constexpr modint(long long x) noexcept : val(x & 1) {}
    constexpr operator bool() const noexcept { return val; }
    constexpr bool value() const noexcept { return val; }
    constexpr modint &operator+=(const modint &other) noexcept { return val ^= other.val, *this; }
    constexpr modint &operator-=(const modint &other) noexcept { return val ^= other.val, *this; }
    constexpr modint &operator*=(const modint &other) noexcept { return val &= other.val, *this; }
    constexpr modint &operator/=(const modint &other) noexcept { assert(other.val); return *this; }
    constexpr modint operator!() const noexcept { return !val; }
    constexpr modint operator-() const noexcept { return *this; }
    constexpr modint operator+(const modint &other) const noexcept { return val != other.val; }
    constexpr modint operator-(const modint &other) const noexcept { return val != other.val; }
    constexpr modint operator*(const modint &other) const noexcept { return val && other.val; }
    constexpr modint operator/(const modint &other) const noexcept { assert(other.val); return *this; }
    constexpr bool operator==(const modint &other) const noexcept { return val == other.val; }
    constexpr bool operator!=(const modint &other) const noexcept { return val != other.val; }
    friend constexpr modint operator+(long long x, modint y) noexcept { return x & 1 ? !y : y; }
    friend constexpr modint operator-(long long x, modint y) noexcept { return x & 1 ? !y : y; }
    friend constexpr modint operator*(long long x, modint y) noexcept { return x & 1 ? y : modint<2>{0}; }
    friend constexpr modint operator/(long long x, modint y) noexcept { assert(y.val); return x & 1 ? y : modint<2>{0}; }
    friend std::ostream &operator<<(std::ostream &os, const modint &other) noexcept { return os << other.val; }
    friend std::istream &operator>>(std::istream &is, modint &other) noexcept { long long val; other.val = (is >> val, val & 1); return is; }
}; // class modint specialization

#endif // Modint_hpp

#ifndef Matrix_hpp
#define Matrix_hpp
// #include <iostream>
// Field must be a field.
template <class Field>
class matrix
{
    std::valarray<std::valarray<Field>> data;
    friend std::istream &operator>>(std::istream &is, matrix &x)
    {
        size_t h = x.height(), w = x.width();
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j) is >> x[i][j];
        }
        return is;
    }
    friend std::ostream &operator<<(std::ostream &os, const matrix &x)
    {
        size_t h = x.height(), w = x.width();
        for(size_t i = 0; i < h; ++i)
        {
            if(i) os << "\n";
            for(size_t j = 0; j < w; ++j) os << (j ? " " : "") << x.data[i][j];
        }
        return os;
    }
    friend matrix pow(matrix x, long long n)
    {
        assert(x.is_square());
        matrix res = identity(x.height());
        while(n)
        {
            if(n & 1) res *= x;
            x *= x, n >>= 1;
        }
        return res;
    }
    friend matrix inverse(const matrix &x)
    {
        assert(x.is_square());
        size_t n = x.height();
        matrix ext_x(x), e(identity(n)), res(n);
        for(size_t i = 0; i < n; ++i) ext_x[i].insert(end(ext_x[i]), begin(e[i]), end(e[i]));
        ext_x = ext_x.row_canonical_form();
        for(size_t i = 0; i < n; ++i)
        {
            if(std::vector<Field>(begin(ext_x[i]), begin(ext_x[i]) + n) != e[i]) return matrix();
            res[i] = std::vector<Field>(begin(ext_x[i]) + n, end(ext_x[i]));
        }
        return res;
    }
public:
    matrix(size_t n = 0) { resize(n, n);}
    matrix(size_t h, size_t w) { resize(h, w); }
    // matrix(const matrix &x) : data(x.data) {}
    matrix(const std::vector<std::vector<Field>> _mat) : data(_mat) {}
    size_t height() const { return data.size(); }
    size_t width() const { return data.size() ? data[0].size() : 0; }
    bool is_square() const { return height() == width(); }
    void resize(size_t h, size_t w, const Field val = Field(0)) { data.resize(h, std::valarray<Field>(val, w)); }
    std::valarray<Field> &operator[](const size_t i) { assert(i < data.size()); return data[i]; }
    static matrix identity(size_t n)
    {
        matrix ret(n, n);
        for(size_t i = 0; i < n; ++i) ret[i][i] = Field(1);
        return ret;
    }
    matrix operator-() const
    {
        size_t h = height(), w = width();
        matrix res(*this);
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                res[i][j] = -data[i][j];
            }
        }
        return res;
    }
    matrix operator&(const matrix &x) const { return matrix(*this) &= x; }
    matrix operator|(const matrix &x) const { return matrix(*this) |= x; }
    matrix operator^(const matrix &x) const { return matrix(*this) ^= x; }
    matrix operator+(const matrix &x) const { return matrix(*this) += x; }
    matrix operator-(const matrix &x) const { return matrix(*this) -= x; }
    matrix operator*(const matrix &x) const { return matrix(*this) *= x; }
    matrix &operator&=(const matrix &x)
    {
        size_t h = height(), w = width();
        assert(h == x.height() and w == x.width());
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                data[i][j] &= x.data[i][j];
            }
        }
        return *this;
    }
    matrix &operator|=(const matrix &x)
    {
        size_t h = height(), w = width();
        assert(h == x.height() and w == x.width());
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                data[i][j] |= x.data[i][j];
            }
        }
        return *this;
    }
    matrix &operator^=(const matrix &x)
    {
        size_t h = height(), w = width();
        assert(h == x.height() and w == x.width());
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                data[i][j] ^= x.data[i][j];
            }
        }
        return *this;
    }
    matrix &operator+=(const matrix &x)
    {
        size_t h = height(), w = width();
        assert(h == x.height() and w == x.width());
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                data[i][j] += x.data[i][j];
            }
        }
        return *this;
    }
    matrix &operator-=(const matrix &x)
    {
        size_t h = height(), w = width();
        assert(h == x.height() and w == x.width());
        for(size_t i = 0; i < h; ++i)
        {
            for(size_t j = 0; j < w; ++j)
            {
                data[i][j] -= x.data[i][j];
            }
        }
        return *this;
    }
    matrix &operator*=(const matrix &x)
    {
        size_t l = height(), m = width(), n = x.width();
        assert(m == x.height());
        matrix res(l, n);
        for(size_t i = 0; i < l; ++i)
        {
            for(size_t j = 0; j < m; ++j)
            {
                for(size_t k = 0; k < n; ++k)
                {
                    res[i][k] += data[i][j] * x.data[j][k];
                }
            }
        }
        return *this = res;
    }
    std::vector<size_t> row_canonicalize()
    {
        std::vector<size_t> pivots;
        const size_t h = height(), w = width();
        for(size_t j = 0, rank = 0; j != w; ++j)
        {
            bool ispiv = false;
            for(size_t i = rank; i != h; ++i)
            {
                if(data[i][j] != Field{})
                {
                    if(ispiv)
                    {
                        const Field r = -data[i][j];
                        for(size_t k = j; k != w; ++k) data[i][k] += data[rank][k] * r;
                    }
                    else
                    {
                        swap(data[rank], data[i]);
                        Field r = data[rank][j];
                        for(size_t k = j; k != w; ++k) data[rank][k] /= r;
                        for(size_t k = 0; k != rank; ++k)
                        {
                            r = -data[k][j];
                            for(size_t l = j; l != w; ++l) data[k][l] += data[rank][l] * r;
                        }
                        ispiv = true;
                    }
                }
            }
            if(ispiv)
            {
                ++rank;
                pivots.emplace_back(j);
            }
        }
        return pivots;
    }
    Field determinant() const
    {
        matrix<Field> x(*this);
        assert(is_square());
        size_t n = height();
        Field res(1);
        for(size_t j = 0; j < n; ++j)
        {
            bool ispiv = false;
            for(size_t i = j; i < n; ++i)
            {
                if(x[i][j] != Field{})
                {
                    if(ispiv)
                    {
                        const Field r = -x[i][j];
                        for(size_t k = j; k < n; ++k) x[i][k] += x[j][k] * r;
                    }
                    else
                    {
                        swap(x[i], x[j]);
                        if(i != j) res = -res;
                        const Field r = x[j][j];
                        res *= r;
                        for(size_t k = j; k < n; ++k) x[j][k] /= r;
                        ispiv = true;
                    }
                }
            }
            if(!ispiv) return Field(0);
        }
        return res;
    }
};
#endif

/* library end */

/* The main code follows. */

using mint=modint<998244353>;
#include <valarray>

struct solver
{
    solver()
    {
        input(int,h);
        input(int,w);
        input(matrix<modint<2>>,a,h,w);
        int rank=a.row_canonicalize().size();
        int kdim=w-rank;
        cout << mint::pow(2,h)*(mint::pow(2,w-1)-mint::pow(2,kdim-1)) << "\n";
    }
}; // struct solver

int main(int argc, char *argv[])
{
    u32 t; // loop count
#ifdef LOCAL
    t = 1;
#else
    t = 1; // single test case
#endif
    // t = -1; // infinite loop
    // cin >> t; // case number given

    while(t--)
    {
        solver();
    }
}


Measured memory_bytes: 384