/* -*- coding: utf-8 -*-
 *
 * 2838.cc:  No.2838 Diagonals - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 500;
const int MAX_M = 500;
const int MOD = 998244353;

/* typedef */

using ll = long long;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

char fs[MAX_N][MAX_M + 4];
UFT uft;

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", fs[i]);

  uft.init(n * m);
  int p = 1;
  
  for (int i = 0, u = 0; i < n; i++)
    for (int j = 0; j < m; j++, u++)
      if (fs[i][j] == '#') {
	bool fi = (i > 0 && fs[i - 1][j] == '#');
	bool fj = (j > 0 && fs[i][j - 1] == '#');
	if (fi && fj && uft.same(u - m, u - 1))
	  p = (ll)p * 2 % MOD;
	else
	  p = (ll)p * 4 % MOD;
	if (fi) uft.merge(u - m, u);
	if (fj) uft.merge(u - 1, u);
      }

  printf("%d\n", p);
  
  return 0;
}