#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;


using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int N, M;
int S[5000][12];
int dp[1 << 12];
void keisan(int b) {

	int kei[12] = {};
	int kazu[12] = {};
	char K[12] = {};
	rep(i, M) K[i] = b >> i & 1;

	rep(i, N) {
		int OK = 1;
		rep(j, M) {
			if (K[j] == 1 && S[i][j] == 0) OK = 0;
		}
		if (OK) {
			rep(j, M) if (K[j] == 0) {
				kei[j]++;
				kazu[j] += S[i][j];
			}
		}
	}
	rep(i, M) if (K[i] == 0) {
		if (kazu[i] >= (kei[i] + 1) / 2) dp[b | 1 << i] += dp[b];
	}
}

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


	cin >> N >> M;
	rep(i, N) rep(j, M) cin >> S[i][j];
	dp[0] = 1;

	rep(i, 1 << M) keisan(i);

	int kotae = dp[(1 << M) - 1];
	co(kotae);

	Would you please return 0;
}