mod = 998244353

H, W = map(int, input().split())
S = []
for _ in range(H):
    s = str(input())
    S.append(s)

dp = [[0 for _ in range(H)] for _ in range(H)]
dp[1][0] = 1

for i in range(1, H + W - 2):
    ndp = [[0 for _ in range(H)] for _ in range(H)]
    for j in range(1, H):
        for k in range(j):
            ax = j
            ay = i - j
            bx = k
            by = i - k
            if not (ax >= 0 and ax < H and ay >= 0 and ay < W and bx >= 0 and bx < H and by >= 0 and by < W):
                continue
            if ax + 1 < H and bx + 1 < H:
                if S[ax + 1][ay] != '#' and S[bx + 1][by] != '#':
                    if i == H + W - 3 or ax + 1 > bx + 1:
                        ndp[j + 1][k + 1] += dp[j][k]
                        if ndp[j + 1][k + 1] >= mod:
                            ndp[j + 1][k + 1] -= mod
            if ax + 1 < H and by + 1 < W:
                if S[ax + 1][ay] != '#' and S[bx][by + 1] != '#':
                    if i == H + W - 3 or ax + 1 > bx:
                        ndp[j + 1][k] += dp[j][k]
                        if ndp[j + 1][k] >= mod:
                            ndp[j + 1][k] -= mod
            if ay + 1 < W and bx + 1 < H:
                if S[ax][ay + 1] != '#' and S[bx + 1][by] != '#':
                    if i == H + W - 3 or ax > bx + 1:
                        ndp[j][k + 1] += dp[j][k]
                        if ndp[j][k + 1] >= mod:
                            ndp[j][k + 1] -= mod
            if ay + 1 < W and by + 1 < W:
                if S[ax][ay + 1] != '#' and S[bx][by + 1] != '#':
                    if i == H + W - 3 or ax > bx:
                        ndp[j][k] += dp[j][k]
                        if ndp[j][k] >= mod:
                            ndp[j][k] -= mod
    for j in range(H):
        for k in range(H):
            dp[j][k] = ndp[j][k]
print(dp[H - 1][H - 1])