#include <bits/stdc++.h>
using namespace std;

#define int ll
#define fast_io cin.tie(0)->sync_with_stdio(0);
#define endl '\n'
typedef long long ll;

int32_t main() {
	fast_io;

	int n, m;
	cin >> n >> m;

	vector<string> grid(n);

	for (auto &s : grid) cin >> s;

	const int MAX = 8 * n * m + 10;
	const int MOD = 998244353;

	vector<int> pot(MAX);
	pot[0] = 1;
	for (int i = 1; i < MAX; i++) pot[i] = pot[i - 1] * 2 % MOD;

	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (grid[i][j] == '#') {
				ans += 3;
				if (i > 0 && grid[i - 1][j] == '#') ans--;
				if (j > 0 && grid[i][j - 1] == '#') ans--;
			}
		}
	}

	vector vis(n, vector(m, 0));
	auto dfs = [&] (auto&& self, int i, int j) {
		if (i < 0 || i >= n || j < 0 || j >= m) return;
		if (vis[i][j]) return;
		if (grid[i][j] != '#') return;

		vis[i][j] = 1;
		self(self, i + 1, j);
		self(self, i - 1, j);
		self(self, i, j + 1);
		self(self, i, j - 1);
	};

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (grid[i][j] == '#' && !vis[i][j]) {
				dfs(dfs, i, j);
				ans--;
			}
		}
	}

	cout << pot[ans] << endl;
}