#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,ll) sort(a.begin(),a.end(),greater<ll>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll,ll> pll;
typedef string str;

const ll maxn=3e5+10;
const ll mod=998244353;
ll dp[maxn];

ll pwr(ll a,ll b){
	if(b==0) return 1;
	ll sta=pwr(a,b/2);
	sta=sta*sta%mod;
	if(b&1) sta=sta*a%mod;
	return sta;
}

string matra[maxn];

void solve(){
	dp[0]=0;
	dp[1]=0;
	dp[2]=1;
	for(ll i=3;i<maxn;i++){
		dp[i]=dp[i-2]+pwr(2,i-2);
		dp[i]%=mod;
		dp[i]+=dp[i-3]+pwr(2,i-3);
		dp[i]%=mod;
		dp[i]+=dp[i-3];
		dp[i]%=mod;
		dp[i]+=dp[i-2];
		dp[i]%=mod;
		dp[i]+=dp[i-2];
		dp[i]%=mod;
		//cout<<dp[i]<<" ";
	}
	ll n,m;
	cin>>n>>m;
	ll koliko=0;
	for(ll i=0;i<n;i++){
		cin>>matra[i];
		for(char j:matra[i]){
			if(j=='o') koliko++;
		}
	}
	ll res=0;
	for(ll i=0;i<n;i++){
		ll sta=0;
		for(ll j=0;j<m;j++){
			if(matra[i][j]=='o') sta++;
			else{
				res+=dp[sta]*pwr(2,koliko-sta)%mod;
				res%=mod;
				sta=0;
			}
		}
		res+=dp[sta]*pwr(2,koliko-sta)%mod;
		res%=mod;
	}
	for(ll j=0;j<m;j++){
		ll sta=0;
		for(ll i=0;i<n;i++){
			if(matra[i][j]=='o') sta++;
			else{
				res+=dp[sta]*pwr(2,koliko-sta)%mod;
				res%=mod;
				sta=0;
			}
		}
		res+=dp[sta]*pwr(2,koliko-sta)%mod;
		res%=mod;
	}
	cout<<res;
}

int main(){
    ios;
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
