#include <iostream>
#include <vector>
#include <map>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)


int main(){
  int M, N;
  cin >> M >> N;
  vector<int> X(1<<N,0);
  rep(i,M){
    int a=0; rep(i,N){ int t; cin >> t; a = a * 2 + t; }
    X[a]++;
  }
  rep(d,N) rep(i,1<<N) if(i&(1<<d)) X[i-(1<<d)] += X[i];

  vector<ll> dp(1<<N,0);
  dp[0] = 1;
  rep(i,1<<N) rep(d,N) if((i&(1<<d)) == 0){
    if(X[i] - X[i|(1<<d)] > X[i|(1<<d)]) continue;
    dp[i|(1<<d)] += dp[i];
  }

  cout << dp.back() << "\n";
  return 0;
}

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_inst;