import sys

input = sys.stdin.buffer.readline


def bit_count(n):
    return bin(n).count("1")


N, M = map(int, input().split())
S = tuple(tuple(map(int, input().split())) for _ in range(N))
Sb = [sum(1 << x for x in range(N) if S[x][i]) for i in range(M)]
dp = [0] * (1 << M)
alive = [0 for _ in range(1 << M)]
dp[0] = 1
alive[0] = (1 << N) - 1
for b in range(1 << M):
    for i in range(M):
        if (b >> i) & 1:
            continue
        affirmative = bit_count(alive[b] & Sb[i])
        c = b | (1 << i)
        if affirmative >= bit_count(alive[b]) - affirmative:
            dp[c] += dp[b]
        if not alive[c]:
            alive[c] = alive[b] & Sb[i]
print(dp[-1])