// g++-15 1.cpp -std=c++23 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;

#include <atcoder/dsu>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

random_device seed;
mt19937_64 randint(seed());

ll grr(ll mi, ll ma) { // [mi, ma)
    return mi + randint() % (ma - mi);
}

constexpr ll mod = 998244353;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n,m;cin>>n>>m;
  vst g(n);
  rep(i,0,n)cin>>g[i];
  vll two(2*n*m+10,1);
  rep(i,1,2*n*m+10){
    two[i]=two[i-1]*2;
    two[i]%=mod;
  }
  dsu d(n*m);
  int c=0;
  rep(i,0,n){
    rep(j,0,m){
      if(g[i][j]=='.')continue;
      if(i>0&&j>0&&d.same(i*m+j-1,(i-1)*m+j))c++;
      else c+=2;
      if(i>0&&g[i-1][j]=='#')d.merge(i*m+j,(i-1)*m+j);
      if(j>0&&g[i][j-1]=='#')d.merge(i*m+j,i*m+j-1);
    }
  }
  cout<<two[c]<<endl;
}