import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

n, m, k = na()
def F(x):
    r = 0
    for i in range(len(x)):
        if x[i] == "1":
            r += (1 << i)
    return r

A = [F(input()) for i in range(m)]

bases = []
for i in range(m):
    x = A[i]
    for e in bases:
        x = min(x, x ^ e)
    if x:
        bases.append(x)

print(pow(2, n - len(bases), 10**9 + 7))  # Output the result modulo 10^9 + 7