#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	mint ans = 1;
	int n, m; cin >> n >> m;
	vector<string>s(n);
	rep(i, n) cin >> s[i];
	int c = 0;
	dsu uf(n *m);
	rep(i, n)rep(j, m) {
		if ('.' == s[i][j])continue;
		int idx = i * m + j;
		int idx0 = (i - 1) * m + j;
		int idx1 = i * m + j - 1;
		if (0 != i && 0 != j) {
			if (uf.same(idx0, idx1))ans *= 2;
			else ans *= 4;
		}
		else {
			ans *= 4;
		}
		if (0 != i && '#' == s[i - 1][j]) uf.merge(idx, idx0);
		if (0 != j && '#' == s[i][j - 1]) uf.merge(idx, idx1);
	}
	cout << ans.val() << endl;
	return 0;
}