#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<vector<int>> s(n,vector<int>(m));
    for(int i = 0;i<n;i++) for(int j = 0;j<m;j++) cin>>s[i][j];
    vector<ll> dp(1<<m,0);
    dp[0] = 1;
    for(int i = 0;i<1<<m;i++){
        vector<int> use(n,0);
        for(int j = 0;j<n;j++){
            bool fn = false;
            for(int k = 0;k<m;k++) if(i>>k&1&&s[j][k]==0) fn = true;
            if(!fn) use[j] = 1;
        }
        for(int j = 0;j<m;j++) if(~i>>j&1){
            int cnt = 0;
            int ok = 0;
            for(int k = 0;k<n;k++) if(use[k]) {
                cnt++;
                if(s[k][j]==1) ok++;
            }
            if(2*ok>=cnt) dp[i|(1<<j)] += dp[i];
        }
    }
    cout<<dp[(1<<m)-1]<<endl;
}