// #include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <string>
#include <deque>
#include <tuple>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <iterator>
#include <random>

using namespace std;

#define int long long
#define ft first
#define sd second
#define rs resize
#define all(a) a.begin(), a.end()

typedef long long ll;
typedef long double ld;

const int MN = 3e5 + 5, MOD = 998244353;
int n, m, p2[MN], pref[MN], w = 0;

int get_sum(int l, int r)
{
    if (r < l || r < 0)
    {
        return 0;
    }
    if (l < 2)
    {
        return pref[r];
    }
    return (pref[r] - pref[l - 2] + MOD) % MOD;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    p2[0] = 1;
    for (int i = 1; i < MN; i++)
    {
        p2[i] = (2 * p2[i - 1]) % MOD;
    }
    pref[0] = 1;
    pref[1] = 2;
    for (int i = 2; i < MN; i++)
    {
        pref[i] = (p2[i] + pref[i - 2]) % MOD;
    }
    cin >> n >> m;
    vector<vector<char>> tab(n, vector<char>(m));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> tab[i][j];
            if (tab[i][j] == 'o')
            {
                w++;
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (int j = 0; j < m; j++)
        {
            if (tab[i][j] == '*')
            {
                cnt = 0;
            }
            else 
            {
                cnt++;
                if (cnt % 2 == 1 && cnt > 1)
                {
                    ans = (ans + get_sum(w - cnt, w - 3)) % MOD;
                }
                if (cnt % 2 == 0)
                {
                    ans = ((ans + get_sum(w - cnt + 1, w - 3)) % MOD + p2[w - cnt]) % MOD;
                }
            }
        }
    }
    for (int j = 0; j < m; j++)
    {
        int cnt = 0;
        for (int i = 0; i < n; i++)
        {
            if (tab[i][j] == '*')
            {
                cnt = 0;
            }
            else 
            {
                cnt++;
                if (cnt % 2 == 1 && cnt > 1)
                {
                    ans = (ans + get_sum(w - cnt, w - 3)) % MOD;
                }
                if (cnt % 2 == 0)
                {
                    ans = ((ans + get_sum(w - cnt + 1, w - 3)) % MOD + p2[w - cnt]) % MOD;
                }
            }
        }
    }
    cout << ans % MOD;
    return 0;
}