// LGV公式、O(HW)
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main() {
    int h,w; cin >> h >> w;
    vector<string> s(h);
    for (int i=0; i<h; i++) cin >> s[i];
    vector dp1(h, vector<mint>(w, mint(0)));
    vector dp2(h, vector<mint>(w, mint(0)));
    dp1[0][0] = 1;
    dp2[1][0] = 1;
    for (int i=0; i<h; i++) for (int j=0; j<w; j++) {
        if (dp1[i][j].val() != 0) {
            if (i+1<h && s[i+1][j] == '.') dp1[i+1][j] += dp1[i][j];
            if (j+1<w && s[i][j+1] == '.') dp1[i][j+1] += dp1[i][j];
        }
        if (dp2[i][j].val() != 0) {
            if (i+1<h && s[i+1][j] == '.') dp2[i+1][j] += dp2[i][j];
            if (j+1<w && s[i][j+1] == '.') dp2[i][j+1] += dp2[i][j];
        }
    }
    mint ans = dp1[h-2][w-1] * dp2[h-1][w-1] - dp2[h-2][w-1] * dp1[h-1][w-1];
    cout << ans.val() << '\n';
}