#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
#define mod 998244353
using namespace std;
inline void upd(int& x,int y){
	x+=y;
	x-= (x>=mod) ? mod : 0;
}
const int N=305;
int pw[N<<1],f[N],a[N][N],n,m;
int main(){
	pw[0]=1;rep(i,1,600)pw[i]=pw[i-1],upd(pw[i],pw[i-1]);
	rep(i,1,N-1)f[i]=pw[(i-1)<<1],upd(f[i],f[i-1]),upd(f[i],f[i-1]);
	scanf("%d%d",&n,&m);
	rep(i,1,n)rep(j,1,m)scanf("%d",&a[i][j]);
	int r=0;
	rep(i,1,m){
		int t=0;
		rep(j,r+1,n)if(a[j][i]){t=j;break;}
		if(!t)continue;
		r++;
		rep(j,1,m)swap(a[r][j],a[t][j]);
		rep(j,r+1,n)if(a[j][i]){
			rep(k,i,m)a[j][k]^=a[r][k];
		}
	}
	int ans=1ll*f[r]*pw[n-r]%mod*pw[m-r]%mod;
	printf("%d\n",ans);
} 