#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector<vector<ll>> Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }

int h, w;
char s[405][405];

ll dp[805][405][405];

int main() {
  cin >> h >> w;
  for (int i = 1; i <= h; i++) {
    for (int j = 1; j <= w; j++) {
      cin >> s[i][j];
    }
  }

  dp[3][2][1] = 1;
  for (int i = 4; i <= h + w; i++) {
    for (int j = 1; j <= w; j++) {
      for (int k = 1; k <= w; k++) {
        dp[i][j][k] = (dp[i - 1][j - 1][k] + dp[i - 1][j][k - 1] +
                       dp[i - 1][j][k] + dp[i - 1][j - 1][k - 1]) %
                      MOD2;
        if (j == k || s[i - j][j] == '#' || s[i - k][k] == '#') {
          dp[i][j][k] = 0;
        }
      }
    }
  }
  cout << (dp[h + w - 1][w][w - 1] + dp[h + w - 1][w - 1][w]) % MOD2 << endl;

  return 0;
}