NN = 16
KK = (1 << (1 << NN)) - 1
I0 = KK // 3
I1 = KK // 5
I2 = KK // 17
I3 = KK // 257

def popcount(x):
    x -= (x >> 1) & I0
    x = (x & I1) + ((x >> 2) & I1)
    x = (x + (x >> 4)) & I2
    x = (x + (x >> 8)) & I3
    x += x >> 16
    x += x >> 32
    x += x >> 64
    x += x >> 128
    x += x >> 256
    x += x >> 512
    x += x >> 1024
    x += x >> 2048
    x += x >> 4096
    return x & 0xffff

N, M = map(int, input().split())
I = [[] for _ in range(M)]
IV = {1 << i: i for i in range(M)}
for i in range(N):
    for j, a in enumerate(input().split()):
        I[j].append(a)
A = []
for ii in I:
    A.append(int("0" + "".join(ii[::-1]), 2))

mmm = (1 << N) - 1
AND = [0] * (1 << M)
PC = [0] * (1 << M)
AND[0] = mmm
PC[0] = N
ANS = [0] * (1 << M)
ANS[0] = 1
for i in range(1, 1 << M):
    a = i & -i
    if a == i:
        AND[i] = A[IV[a]]
        PC[i] = popcount(AND[i])
    else:
        AND[i] = AND[a] & AND[i^a]
        PC[i] = popcount(AND[i])
    
    pc = PC[i]
    ans = 0
    for j in range(N):
        if i >> j & 1:
            ij = i ^ (1 << j)
            ppc = PC[ij]
            if pc * 2 >= ppc:
                ans += ANS[ij]
    ANS[i] = ans

print(ANS[-1])