#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;

ll mod = 998244353;

int main() {
    int H, W;
    cin >> H >> W;
    vector<string> S(H);
    for (int i = 0; i < H; i++) {
        cin >> S[i];
    }
    // dp[i][j] = (Alice の x 座標が i, Bob の x 座標が j)
    vector<vector<ll>> dp(H, vector<ll>(H, 0));
    dp[1][0] = 1;
    for (int i = 1; i < H + W - 2; i++) {
        vector<vector<ll>> ndp(H, vector<ll>(H, 0));
        for (int j = 1; j < H; j++) {
            for (int k = 0; k < j; k++) {
                if (j + 1 < H && k + 1 < H) {
                    if (S[j + 1][i - j] != '#' && S[k + 1][i - k] != '#') {
                        if ((j + 1 == H - 1 && k + 1 == H - 1) ||
                            j + 1 > k + 1) {
                            ndp[j + 1][k + 1] += dp[j][k];
                            if (ndp[j + 1][k + 1] >= mod) {
                                ndp[j + 1][k + 1] -= mod;
                            }
                        }
                    }
                }
                if (j + 1 < H && i + 1 - k < W) {
                    if (S[j + 1][i - j] != '#' && S[k][i + 1 - k] != '#') {
                        if ((j + 1 == H - 1 && k == H - 1) || j + 1 > k) {
                            ndp[j + 1][k] += dp[j][k];
                            if (ndp[j + 1][k] >= mod) {
                                ndp[j + 1][k] -= mod;
                            }
                        }
                    }
                }
                if (i + 1 - j < W && k + 1 < H) {
                    if (S[j][i + 1 - j] != '#' && S[k + 1][i - k] != '#') {
                        if ((j == H - 1 && k + 1 == H - 1) || j > k + 1) {
                            ndp[j][k + 1] += dp[j][k];
                            if (ndp[j][k + 1] >= mod) {
                                ndp[j][k + 1] -= mod;
                            }
                        }
                    }
                }
                if (i + 1 - j < W && i + 1 - k < W) {
                    if (S[j][i + 1 - j] != '#' && S[k][i + 1 - k] != '#') {
                        if ((j == H - 1 && k == H - 1) || j > k) {
                            ndp[j][k] += dp[j][k];
                            if (ndp[j][k] >= mod) {
                                ndp[j][k] -= mod;
                            }
                        }
                    }
                }
            }
        }
        for (int j = 0; j < H; j++) {
            for (int k = 0; k < H; k++) {
                dp[j][k] = ndp[j][k];
            }
        }
    }
    cout << dp[H - 1][H - 1] << endl;
}