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

from collections import Counter

h, w = LI()
ss = [[c == "#" for c in SI()] for _ in range(h)]

def push(i, j, p, q, val):
    if i == p or i == h or j == w or p == h or q == w or ss[i][j] or ss[p][q]: return
    dp[i*w+j, p*w+q] += val
    dp[i*w+j, p*w+q] %= md

dp = Counter()
dp[1, w] = 1
for _ in range(h-2+w-2):
    pre, dp = dp, Counter()
    for u, v in pre:
        i, j = divmod(u, w)
        p, q = divmod(v, w)
        push(i+1, j, p+1, q, pre[u, v])
        push(i+1, j, p, q+1, pre[u, v])
        push(i, j+1, p+1, q, pre[u, v])
        push(i, j+1, p, q+1, pre[u, v])

print(sum(dp.values())%md)