#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, M;
  cin >> N >> M;

  int SM[N];
  bool S[N][M];
  for (int i = 0; i < N; ++i) {
    int mask = 0;
    for (int j = 0; j < M; ++j) {
      cin >> S[i][j];
      if (S[i][j]) {
        mask |= (1 << j);
      }
    }
    SM[i] = mask;
  }

  int L = 1 << M;
  ll dp[L];
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;

  for (int mask = 0; mask < L; ++mask) {
    for (int i = 0; i < M; ++i) {
      if (mask >> i & 1) continue;

      int all = 0;
      int num = 0;

      for (int j = 0; j < N; ++j) {
        if ((mask & SM[j]) != mask) continue;

        if (S[j][i]) {
          ++num;
        }
        ++all;
      }

      int nmask = mask | (1 << i);
      // fprintf(stderr, "mask: %d, nmask: %d, (%d/%d)\n", mask, nmask, num, all);
      if (num >= (all + 1) / 2) {
        dp[nmask] += dp[mask];
      }
    }
  }

  cout << dp[L - 1] << endl;

  return 0;
}