#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
vector<string> vec_splitter(string s) {
    for(char& c: s) c = c == ','?  ' ': c;
    stringstream ss; ss << s;
    vector<string> res;
    for(string z; ss >> z; res.push_back(z))
        ;
    return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
    if(idx > 0) cerr << ", ";
    stringstream ss; ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, T...);
}
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __VA_ARGS__)
void localTest() {
    #ifndef ONLINE_JUDGE
        freopen("inp", "r", stdin);
        freopen("out", "w", stdout);
    #endif      
}
const ll MOD = 998244353, N = 3e5 + 5;
ll po[N];
ll power(ll a, ll b, ll c) {
    ll ret = 1;
    while(b) {
        if(b & 1) {
            ret = (ret * a) % c;
        }
        b >>= 1;
        a = (a * a) % c;
    }
    return ret;
}
void solver() {
    ll n, m, ans = 0;
    cin >> n >> m;
    string s[n];
    ll tot = 0;
    for(int i = 0; i < n; ++i) {
        cin >> s[i];
        for(int j = 0; j < m; ++j) {
            if(s[i][j] == 'o') {
                ++tot;
            } 
        }
    }
    ll mul = power(2, tot, MOD);
    po[0] = (mul * power(4, MOD - 2, MOD)) % MOD;
    ll curr = po[0], den = power(2, MOD - 2, MOD);
    for(int i = 1; i < N; ++i) {
        ll val = (curr * den) % MOD;
        if(i & 1) {
            po[i] = (po[i - 1] - val + MOD) % MOD;
        } else {
            po[i] = (po[i - 1] + val) % MOD;
        }
        curr = val;
    }
    for(int i = 0; i < n; ++i) {
        ll cnt = 0;
        for(int j = 0; j < m; ++j) {
            if(s[i][j] == 'o') {
                ++cnt;
                if(cnt >= 2) {
                    ans += po[cnt - 2];
                }
            } else {
                cnt = 0;
            }
        }
        ans %= MOD;
    }
    for(int j = 0; j < m; ++j) {
        ll cnt = 0;
        for(int i = 0; i < n; ++i) {
            if(s[i][j] == 'o') {
                ++cnt;
                if(cnt >= 2) {
                    ans += po[cnt - 2];
                }
            } else {
                cnt = 0;
            }
        }
        ans %= MOD;
    }
    cout << ans << "\n";
    return;
}
int main() {

    localTest();
    fastio;
    int t = 1;
    // cin >> t;
    while(t--) {
        solver();
    }

    return 0;
}
  	 			 	 		  	   						    			