import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

h,w=LI()
ss=[[c=="#" for c in SI()] for _ in range(h)]
c=sum(ss[0])
if h>1:c+=sum(ss[-1])
for i in range(h-1):
    for j in range(w):
        c+=ss[i][j] or ss[i+1][j]

for i in range(h):
    c+=ss[i][0]
    for j in range(w-1):
        c+=ss[i][j]==False and ss[i][j+1]

def dfs(i,j):
    st=[(i,j)]
    while st:
        i,j=st.pop()
        for di, dj in dij:
            ni, nj = i+di, j+dj
            if ni < 0 or nj < 0 or ni >= h or nj >= w: continue
            if ss[ni][nj]:
                ss[ni][nj]=False
                st.append((ni,nj))

for i in range(h):
    for j in range(w):
        if ss[i][j]:
            ss[i][j]=False
            dfs(i,j)
            c-=1
# print(c)
print(pow(2,c,md))