#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1) #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2) #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = tuple; //using func = pair; val op(val a, val b) { return max(a, b); } val e() { return make_tuple(0LL, 0LL, 0LL); } // //val mp(func f, val a) //{ // if (f.first < 0) // return a; // return f; //} //func comp(func f, func g) { // if (g.first < 0) // return f; // return g; //} // //func id() { // return MP(-1, -1); //} ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; using u64 = unsigned long long; class NimProduct { public: NimProduct(int k = 6) { pre.resize(256, vector(256)); preinv.resize(256); // precalc for (int a = 255; a > 1; a--) { for (int b = 255; b > 1; b--) { prod_impl(a, b, 3); } } for (int a = 1; a < 256; a++) { for (int b = 1; b < 256; b++) { if (pre[a][b] == 1) { preinv[a] = b; break; } } } }; u64 prod_impl(u64 a, u64 b, int k = 6) { if (a <= 1 || b <= 1) { return a * b; } if (a < 256 && b < 256 && pre[a][b] != 0) { } u64 kb = 1LL << (k - 1); u64 mask = (1LL << kb) - 1; if (a <= mask && b <= mask) { return prod_impl(a, b, k - 1); } u64 au = a >> kb; u64 al = a & mask; u64 bu = b >> kb; u64 bl = b & mask; u64 l = prod_impl(au, bu, k - 1) ^ prod_impl(al, bu, k - 1) ^ prod_impl(au, bl, k - 1); u64 r = prod_impl(prod_impl(au, bu, k - 1), u64(1) << (kb - 1), k - 1) ^ prod_impl(al, bl, k - 1); u64 res = (l << kb) ^ r; if (a < 256 && b < 256) pre[a][b] = res; return res; } u64 inv_impl(u64 a, int k = 6) { if (a < 256) { return preinv[a]; } u64 kb = 1LL << (k - 1); if (a < kb) { return inv_impl(a, k - 1); } u64 a_h = a >> kb; u64 a_l = a - (a_h << kb); u64 half_inv = inv_impl(prod_impl(a_h ^ a_l, a_l, k) ^ prod_impl(prod_impl(a_h, a_h, k - 1), 1ULL << (kb - 1)), k - 1); return (prod_impl(half_inv, a_h, k) << kb) ^ prod_impl(half_inv, a_h ^ a_l, k); } u64 prod(u64 a, u64 b) { return prod_impl(a, b); } u64 inv(u64 a) { return inv_impl(a); } vector> pre; vector preinv; }; void solve() { NimProduct np; ll n, t; cin >> n >> t; vector h(t, vector()); REP(i, t) { h[i] = read(n); DEC(h[i]); } mint2 fr = mint2(2).pow(64); mint2 ans = 0; ll bn = 1LL << n; REP(b, bn) { vector use(t); mint2 add = 1; REP(j, n) { if (EXISTBIT(b, j)) continue; ll idx = -1; u64 inv = 0; REP(i, t) { if (use[i] || h[i][j] == 0) continue; idx = i; inv = np.inv(h[i][j]); break; } if (idx == -1) { add *= fr; continue; } use[idx] = true; REP(i, t) { if (i == idx || h[i][j] == 0) continue; unsigned long long mul = np.prod(inv, h[i][j]); REP(jj, n) { h[i][jj] ^= np.prod(mul, h[idx][jj]); } } } ans += __popcount(b) % 2 ? -add : add; } cout << ans.val(); return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }