class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

def encode(h, w):
    return h*M+w

MOD = 998244353

N, M = map(int, input().split())
S = [input() for _ in range(N)]

UF = UnionFind(N*M)

ans = 1
for i in range(N):
    for j in range(M):
        if S[i][j] == "#":
            if 1 <= i and 1 <= j and S[i-1][j] == S[i][j-1] == "#" and UF.same(encode(i-1, j), encode(i, j-1)):
                ans *= 2
                ans %= MOD
            else:
                ans *= 4
                ans %= MOD
            if 1 <= i and S[i-1][j] == "#":
                UF.merge(encode(i, j), encode(i-1, j))
            if 1 <= j and S[i][j-1] == "#":
                UF.merge(encode(i, j), encode(i, j-1))

print(ans)