import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

def solve():
    cc = [[-1]*w, [-1]*w]
    res = 1
    for i in range(h):
        ni = i & 1
        for j, a in enumerate(aa[i]):
            if a == -1: continue
            if cc[ni][j] == -1: cc[ni][j] = a
            elif a != cc[ni][j]: return 0
    # p2D(cc)
    for a, b in zip(cc[0], cc[1]):
        if a == b == -1: res = res*2%md
        elif a == b == 0 or a == b == 1: return 0
    return res

h, w = LI()

aa = [[-1]*w for _ in range(h)]

for i in range(h):
    for j, c in enumerate(SI()):
        if c == "?": continue
        c = int(c)
        aa[i][j] = c
# p2D(aa)

ans = -1
ans += solve()
# pDB(ans)
aa = [col for col in zip(*aa)]
h, w = w, h
ans += solve()
# pDB(ans)
x = -1
for i in range(h):
    for j, a in enumerate(aa[i]):
        if a == -1: continue
        if x == -1:
            x = (i+j+a) & 1
        elif x != (i+j+a) & 1:
            ans += 1
            print(ans%md)
            exit()
if x == -1: ans -= 1
print(ans%md)