#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<vi> vvi;
typedef std::vector<ll> vll;
typedef std::vector<vll> vvll;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

ll mod = 998244353;

/*
 * 選ぶ行を決めた時，ある列を選んだ時mod2で和が+1となるか+0となるかが決まる
 * このとき+1の列の数と+0の列の数のみで場合の数が決まる
 * よって+1の列の数が0〜Mとなるケースのそれぞれについて行の選び方の場合の数が分かればよい
 */

ll gcd(ll a, ll b) {
  if (a < 0) { a *= (-1); }
  if (b < 0) { b *= (-1); }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
  if (a < 0) { a *= (-1); }
  if (b < 0) { b *= (-1); }
  return a / gcd(a, b) * b;
}

vvll gaussian_elimination_mod2(vvll a) {
  int n = a.size();
  int m = a[0].size();
  int k_add = 0;
  rep (k, n) {
    while (true) {
      if (k + k_add >= m) {
        return a;
      }
      if (a[k][k + k_add] == 0) {
        FOR (i, k+1, n) {
          if (a[i][k + k_add] != 0) {
            swap(a[k], a[i]);
            break;
          }
        }
      }
      if (a[k][k + k_add] != 0) {
        break;
      } else {
        k_add += 1;
      }
    }
    FOR (i, k+1, n) {
      if (a[i][k + k_add] == 0) { continue; }
      FOR (j, k + k_add, m) {
        a[i][j] = a[i][j] - a[k][j];
        if (a[i][j] == -1) { a[i][j] *= (-1); }
      }
    }
  }
  return a;
}

int calc_rank(vvll a) {
  int n = a.size();
  int m = a[0].size();
  int ret = 0;
  rep (i, n) {
    rep (j, m) {
      if (a[i][j] != 0) {
        ret += 1;
        break;
      }
    }
  }
  return ret;
}

ll po(ll k, ll x) {
  if (x == 0) {
    return 1;
  }
  if (x == 1) {
    return k % mod;
  }
  ll y = po(k, x/2);
  y = y * y % mod;
  if (x % 2 == 1) {
    y = y * k % mod;
  }
  return y;
}

int main() {
  int n, m;
  scan(n, m);
  vvll a(n, vll(m));
  scan(a);

  auto b = gaussian_elimination_mod2(a);
  int rank_a = calc_rank(b);

  ll ans = po(2, n) - po(2, n - rank_a) + mod;
  ans %= mod;
  ans = (ans * po(2, m-1)) % mod;
  print(ans);

  return 0;
}


Measured memory_bytes: 2432