#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}

const int N = 310;

const ll M = 998244353;

ll pw(ll a, ll n) {
    ll ret = 1;
    while (n) {
        if (n & 1) ret = ret * a % M;
        a = a * a % M;
        n >>= 1;
    }
    return ret;
}

ll nCr[N][N];

void init() {
    nCr[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            nCr[i][j] = nCr[i - 1][j];
            if (j) nCr[i][j] = (nCr[i][j] + nCr[i - 1][j - 1]) % M;
        }
    }
}

int n, m;

int gauss(vector<bitset<N>> &a) {

    int kek = 0;
    fori (i, m) {
        bool ok = false;
        for (int j = kek; j < n; ++j) {
            if (a[j][i]) {
                swap(a[kek], a[j]);
                ok = true;
                break;
            }
        }
        if (ok) {
            for (int j = 0; j < n; ++j) if (j != kek) {
                if (a[j][i]) {
                    a[j] ^= a[kek];
                }
            }
            kek++;
        }
    }
    return kek;
}

void smain() {

    init();


    cin >> n >> m;
    vector<bitset<N>> a(n);
    fori (i, n) {
        fori (j, m) {
            bool cur;
            cin >> cur;
            if (cur) a[i].set(j);
        }
    }

    int r = gauss(a);
    ll ans = 0;
    for (int i = 0; i <= r; i += 2) {
        ll cur = nCr[r][i] * pw(3, r - i) % M;
        ans = (ans + cur) % M;
    }
    ans = ans * pw(2, n + m - 2 * r) % M;
    ans = (pw(2, n + m) - ans   + M) % M;
    cout << ans;
}


Measured memory_bytes: 1024