#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector s(n, vector(m, 0)); REP(i, n) REP(j, m) cin >> s[i][j];
  vector<ll> dp(1 << m, 0);
  dp[0] = 1;
  REP(i, 1 << m) {
    vector<int> alive(n, 1);
    REP(j, m) {
      if (i >> j & 1) {
        REP(k, n) {
          if (s[k][j] == 0) alive[k] = 0;
        }
      }
    }
    int mem = count(ALL(alive), 1);
    if (mem == 0) continue;
    REP(j, m) {
      if (i >> j & 1) continue;
      int ag = 0;
      REP(k, n) ag += alive[k] && s[k][j] == 1;
      if (ag >= (mem + 1) / 2) dp[i | (1 << j)] += dp[i];
    }
  }
  cout << dp[(1 << m) - 1] << '\n';
  return 0;
}