import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
from decimal import Decimal
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

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

def main():
    mod = 10**9+7
    mod2 = 998244353
    n, m = map(int, input().split())
    S = [list(map(int, input().split())) for i in range(n)]
    people = [0]*m
    for i in range(n):
        for j in range(m):
            people[j] += S[i][j] << i
    dp = [0]*2**m
    check = [0]*2**m
    check[0] = 2**n-1
    pop=[0]*2**m
    pop[0]=n
    dp[0] = 1
    for bit in range(1, 2**m):
        for i in range(m):
            if bit & (1 << i):
                if not check[bit]:
                    check[bit]=check[bit & ~(1 << i)] & people[i]
                    pop[bit]=popcnt1(check[bit])
                if pop[bit]*2 >= pop[bit & ~(1 << i)]:
                    dp[bit]+=dp[bit & ~(1 << i)]
    print(dp[-1])
                
                
                



if __name__ == '__main__':
    main()