H, W = map(int, input().split())
S = [input() for _ in range(H)]
MOD = 998244353

dp = [[0]*H for _ in range(H)]
dp[1][0] = 1
for n in range(2, H+W-2):
  ndp = [[0]*H for _ in range(H)]
  for ia in range(H):
    for ib in range(H):
      if ia==ib: continue
      ja1 = n-(ia+1)
      jb1 = n-(ib+1)
      ja = n-ia
      jb = n-ib
      if 0<=ia+1<H and 0<=ja1<W and S[ia+1][ja1]=='.':
        if 0<=ib+1<H and 0<=jb1<W and S[ib+1][jb1]=='.':
          if ia+1!=ib+1:
            ndp[ia+1][ib+1] += dp[ia][ib]
            ndp[ia+1][ib+1] %= MOD
        if 0<=ib<H and 0<=jb<W and S[ib][jb]=='.':
          if ia+1!=ib:
            ndp[ia+1][ib] += dp[ia][ib]
            ndp[ia+1][ib] %= MOD
      if 0<=ia<H and 0<=ja<W and S[ia][ja]=='.':
        if 0<=ib+1<H and 0<=jb1<W and S[ib+1][jb1]=='.':
          if ia!=ib+1:
            ndp[ia][ib+1] += dp[ia][ib]
            ndp[ia][ib+1] %= MOD
        if 0<=ib<H and 0<=jb<W and S[ib][jb]=='.':
          if ia!=ib:
            ndp[ia][ib] += dp[ia][ib]
            ndp[ia][ib] %= MOD
  dp = ndp
print(dp[H-1][H-2])