import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 998244353L;
enum LIM = 310;

int M, N;
int[][] A;

void main() {
  auto two = new long[LIM];
  two[0] = 1;
  foreach (i; 1 .. LIM) {
    two[i] = (two[i - 1] * 2) % MO;
  }
  
  try {
    for (; ; ) {
      M = readInt();
      N = readInt();
      A = new int[][](M, N);
      foreach (i; 0 .. M) foreach (j; 0 .. N) {
        A[i][j] = readInt();
      }
      
      auto a = new int[][](M, N);
      foreach (i; 0 .. M) foreach (j; 0 .. N) {
        a[i][j] = A[i][j];
      }
      int r;
      foreach (h; 0 .. N) {
        foreach (i; r .. M) {
          if (a[i][h]) {
            swap(a[r], a[i]);
            break;
          }
        }
        if (a[r][h]) {
          foreach (i; r + 1 .. M) {
            if (a[i][h]) {
              foreach (j; h .. N) {
                a[i][j] ^= a[r][j];
              }
            }
          }
          ++r;
        }
      }
      debug {
        writeln("rank = ", r);
      }
      long ans;
      ans += two[M + N - 1];
      ans -= two[M + N - 1 - r];
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}