#include<bits/stdc++.h>
using namespace std;
#define int long long
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
template<typename T,typename... A>
void err(T a,A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
template<class T>
void print(T x,int suc=1)
{
    cout<<x;
    if(suc==1) cout<<'\n';
    else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
    for(int i=0;i<v.size();i++)
        print(v[i],i==(int)(v.size())-1?suc:2);
}
const int maxn=1e6+7;
#define FOR(i,n) for(int i=0;i<n;++i)
int dp[1<<13];//表示S能搞完的方案数
//dp[]
int C[maxn];
int N,M;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,N) {
		x=0;
		FOR(j,M) {
			cin>>y;
			x=x*2+y;
		}
		C[x]++;
	}
	
	dp[0]=1;
	int mask,mask2;
	FOR(mask,1<<M) if(dp[mask]) {
		FOR(j,M) if((mask&(1<<j))==0) {
			int win=0,lose=0;
			FOR(mask2,1<<M) if((mask&mask2)==mask) {
				if(mask2&(1<<j)) win+=C[mask2];
				else win-=C[mask2];
			}
			if(win>=0) dp[mask|(1<<j)]+=dp[mask];
		}
	}
	cout<<dp[(1<<M)-1]<<endl;
}
signed main() {
	solve();
}