#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const int N_MAX = 5000;
using bs = bitset<N_MAX>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<bs> v(m);
    vector<bs> f(1<<m);
    vector<int> rem(1<<m);
    vector<ll> dp(1<<m);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            int x; cin >> x;
            v[j][i] = x;
        }
    }
    bs all;
    for(int i = 0; i < n; i++) all[i] = 1;
    for(int i = 0; i < (1<<m); i++){
        f[i] = all;
        for(int j = 0; j < m; j++){
            if(i&(1<<j)) f[i] &= v[j];
        }
        rem[i] = f[i].count();
        // cout << f[i] << endl;     
    }

    dp[0] = 1;
    for(int i = 1; i < (1<<m); i++){
        for(int j = 0; j < m; j++){
            if(i&(1<<j)){
                int pre = i-(1<<j);
                if(f[i].count()*2 >= f[pre].count()) dp[i] += dp[pre];
            }
        }
    }
    cout << dp[(1<<m)-1] << endl;
}