#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

// naive

signed main(){
    int N,M;cin>>N>>M;
    vector<vector<int>> A(N,vector<int>(M));
    cin>>A;

    vector<ll> dp(1<<M,0);
    dp[0]=1;

    rep(bit,1<<M){

        // ここを高速化
        vector<int> alive;
        rep(i,N){
            bool flag=true;
            rep(j,M)if((bit>>j)&1 and A[i][j]==0) flag=false;
            if(flag) alive.push_back(i);
        }


        rep(i,M)if(!((bit>>i)&1)){
            int cnt=0;
            for(auto &j:alive) cnt+=A[j][i];
            if(cnt*2>=(int)alive.size()){
                dp[bit+(1<<i)]+=dp[bit];
            }
        }
    }
    cout<<dp[(1<<M)-1]<<endl;
    return 0;
}