#include <bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll I=1167167167167167167; ll Q=1e9+7; #define rep(i,a) for (ll i=0;i<a;i++) template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";} void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";} //おちこんだりもしたけれど、私はげんきです。 int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N,M; cin>>N>>M; vector<vector<bitset<60>>> bit((1<<M),vector<bitset<60>>(84,0)); rep(i,N) bit[0][i/60]|=(1ll<<(i%60)); rep(i,N){ rep(j,M){ int a; cin>>a; if(a) bit[1<<j][i/60]|=((1ll<<(i%60))); } } vector<int> p((1<<M),0); rep(i,(1<<M)){ if(i==0){ p[i]=N; continue; } rep(j,M){ if(i&(1<<j)){ int a=(1<<j); int b=(i^(1<<j)); rep(k,84){ bit[i][k]=(bit[a][k]&bit[b][k]); p[i]+=(int)(bit[i][k].count()); } break; } } //cout<<p[i]<<endl; } vector<ll> dp(1<<M,0); dp[0]=1; rep(i,(1<<M)){ rep(j,M){ if(!(i&(1<<j))){ if(p[i]<=2*p[(i|(1<<j))]){ dp[i|(1<<j)]+=dp[i]; } } } } cout<<dp[((1<<M)-1)]<<"\n"; return 0; }