#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint998244353;

int main(){
	int n, m;
	cin >> n >> m;
	vector<string> s(n);
	cin >> s;
	mint ans = 1;
	vector<vector<int>> done(n, vector<int>(m));
	queue<pair<int, int>> qu;
	rep(y, n) rep(x, m){
		if(s[y][x] == '.') continue;
		qu.emplace(y, x);
		while(qu.size()){
			auto [y, x] = qu.front(); qu.pop();
			if(done[y][x]) continue;
			done[y][x] = 1;
			int closure = 0;
			if(y > 0) if(done[y - 1][x]) closure++;
			if(x > 0) if(done[y][x - 1]) closure++;
			if(y < n - 1)if(done[y + 1][x]) closure++;
			if(x < m - 1) if(done[y][x + 1]) closure++;
			if(closure >= 3) ans *= 1;
			if(closure == 2) ans *= 2;
			if(closure <= 1) ans *= 4;
			if(y > 0) if(s[y - 1][x] == '#') qu.emplace(y - 1, x);
			if(x > 0) if(s[y][x - 1] == '#') qu.emplace(y, x - 1);
			if(y < n - 1)if(s[y + 1][x] == '#') qu.emplace(y + 1, x);
			if(x < m - 1) if(s[y][x + 1] == '#') qu.emplace(y, x + 1);
		}
	}
	cout << ans << "\n";
	return 0;
}