#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<ctime>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<bitset>

#define N 305
#define M 8000005

#define ls (t<<1)
#define rs ((t<<1)|1)
#define mid ((l+r)>>1)

#define mk make_pair
#define pb push_back
#define fi first
#define se second

#define Mo 998244353

using namespace std;

bitset<305>A[305];

int a[N][N],n,m,i,j;

int power(int x,int y)
{
		int s=1;
		for(;y;y>>=1)
		{
				if(y&1) s=1ll*s*x%Mo;
				x=1ll*x*x%Mo; 
		}
		return s;
}

int Guass()
{
		int i,j,k,cnt=0;
		for (i=1;i<=n;++i)
		{
				for (j=cnt+1;j<=m;++j) if (A[j][i]) break;
				if (j>m) continue;
				++cnt;
				swap(A[cnt],A[j]);
				for (j=cnt+1;j<=m;++j)
					if (A[j][i]) A[j]^=A[cnt]; 
		}
		return power(2,n-cnt);
}

int main()
{
		scanf("%d%d",&n,&m);
		for (i=1;i<=n;++i) 
			for (j=1;j<=m;++j) scanf("%d",&a[i][j]);
		for (i=1;i<=m;++i)
			for (j=1;j<=n;++j) A[i][j]=a[j][i];
		printf("%d\n",1ll*(power(2,n)-Guass()+Mo)%Mo*power(2,m-1)%Mo); 
}