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")
#######################################################################
h, w = na()
s = [input() for i in range(h)]
mod = 998244353
def solve(sx, sy, tx, ty):
    dp = [[0] * h for j in range(w)]
    dp[sx][sy] = 1
    for i in range(h):
        for j in range(w):
            if i + 1 < h and s[i+1][j] == ".":
                dp[i+1][j] += dp[i][j]
                dp[i+1][j] %= mod
            if j + 1 < w and s[i][j+1] == ".":
                dp[i][j+1] += dp[i][j]
                dp[i][j+1] %= mod
    return dp[tx][ty]

a = solve(1, 0, h-1, w-2)
b = solve(0, 1, h-1, w-2)
c = solve(1, 0, h-2, w-1)
d = solve(0, 1, h-2, w-1)
# print(a, b, c, d)
print((a * d - b * c) % mod)