#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
const double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = 4 * 1e18;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
template <class T>
inline bool chmax(T &a, T b)
{    if (a < b)    {        a = b;        return 1;    }    return 0;}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

//atcoder
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;


int main() {
	vector<pair<ll, ll>> base={{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    ll N, M, co=0, co2=0;
    cin >> N >> M;
    vector<string> G(N);
    mint2 ans=1;
    rep(i, 0, N) {
    	cin >> G.at(i);
    }
    rep(i, 0, N) {
        rep(j, 0, M) {
            if (G.at(i).at(j)=='#') {
                ans*=4;
                co2++;
                rep(k, 0, 4) {
                    ll x=i+base.at(k).first;
                    ll y=j+base.at(k).second;
                    if (x>=0 && x<N && y>=0 && y<M) {
                        if (G.at(x).at(y)=='#') {
                            co++;
                        }
                    }
                }
            }
        }
    }
    co/=2;
    //cout << co << " " << co2 << endl;
    rep(i, 0, co+1-co2) {
        ans/=2;
    }
    cout << ans.val();
}