import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(int M_) {
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 998_244_353;
alias Mint = ModInt!MO;

enum LIM = 100;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}


void main() {
  prepare();
  auto S = new Mint[][](LIM, LIM);
  foreach (n; 0 .. LIM) {
    S[n][0] = 0;
    S[n][n] = 1;
    foreach (k; 1 .. n) {
      S[n][k] = S[n - 1][k - 1] + k * S[n - 1][k];
    }
  }
  
  /*
  debug {
    foreach (h; 1 .. 5 + 1) foreach (w; 1 .. 5 + 1) {
      foreach (p; 0 .. 1 << (h * w)) {
        auto a = new int[][](h, w);
        foreach (x; 0 .. h) foreach (y; 0 .. w) {
          a[x][y] = (p >> (x * w + y)) & 1;
        }
        int rows, cols;
        foreach (x0; 0 .. h) foreach (x1; 0 .. h) foreach (y0; 0 .. w) foreach (y1; 0 .. w) {
          if (a[x0][y0] == 0 &&
              a[x0][y1] == 1 &&
              a[x1][y0] == 1 &&
              a[x1][y1] == 0) {
            rows |= 1 << x0 | 1 << x1;
            cols |= 1 << y0 | 1 << y1;
          }
        }
        const hos = (rows == (1 << h) - 1 && cols == (1 << w) - 1);
        bool ysp = true;
        foreach (x; 0 .. h) {
          ysp = ysp && !iota(w).all!(y => (a[x][y] == 0));
          ysp = ysp && !iota(w).all!(y => (a[x][y] == 1));
        }
        foreach (y; 0 .. w) {
          ysp = ysp && !iota(h).all!(x => (a[x][y] == 0));
          ysp = ysp && !iota(h).all!(x => (a[x][y] == 1));
        }
        if (hos != ysp) {
          foreach (x; 0 .. h) {
            writeln(a[x]);
          }
          writeln(hos, " ", ysp);
          assert(false);
        }
      }
    }
  }
  */
  
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      auto A = new string[H];
      foreach (x; 0 .. H) {
        A[x] = readToken();
      }
      
      debug {
        if (H * W <= 20) {
          long brt;
          foreach (p; 0 .. 1 << (H * W)) {
            auto b = new int[][](H, W);
            foreach (x; 0 .. H) foreach (y; 0 .. W) {
              b[x][y] = (p >> (x * W + y)) & 1;
            }
            bool ok = true;
            bool orig = false;
            foreach (x0; 0 .. H) foreach (x1; 0 .. H) foreach (y0; 0 .. W) foreach (y1; 0 .. W) {
              if (b[x0][y0] == 0 &&
                  b[x0][y1] == 1 &&
                  b[x1][y0] == 1 &&
                  b[x1][y1] == 0) {
                if (A[x0][y0] == '.' &&
                    A[x0][y1] == '#' &&
                    A[x1][y0] == '#' &&
                    A[x1][y1] == '.') {
                  orig = true;
                } else {
                  ok = false;
                }
              }
            }
            if (ok) {
              ++brt;
              /*
              if (orig) {
                foreach (x; 0 .. H) {
                  writeln(b[x]);
                }
                writeln();
              }
              //*/
            }
          }
          writeln(brt);
        }
      }
      
      auto waf = new Mint[][](H + 1, W + 1);
      foreach (h; 0 .. H + 1) foreach (w; 0 .. W + 1) {
        foreach (i; 0 .. min(h, w) + 2) {
          waf[h][w] += fac[i] * fac[i] * S[h][i] * S[w][i];
          waf[h][w] += fac[i] * fac[i] * S[h][i] * S[w][i];
          waf[h][w] += fac[i] * fac[i + 1] * S[h][i] * S[w][i + 1];
          waf[h][w] += fac[i + 1] * fac[i] * S[h][i + 1] * S[w][i];
        }
      }
      waf[0][0] = 1;
      debug {
        foreach (h; 0 .. H + 1) {
          writefln("waf[%s] = %s", h, waf[h]);
        }
      }
      
      auto pre = new Mint[][](H + 1, W + 1);
      foreach (h; 0 .. H + 1) foreach (w; 0 .. W + 1) {
        if (h == H && w == W) {
          foreach (i; 0 .. min(h, w) + 1) {
            pre[h][w] += fac[i]^^2 * S[h + 1][i + 1] * S[w + 1][i + 1];
          }
        } else if (h < H && w < W) {
          foreach (i; 0 .. h + 1) foreach (j; 0 .. w + 1) {
            Mint tmp = binom(h, i) * binom(w, j);
            // if (i > 0 && w - j > 0) tmp *= fac[i + (w - j)];
            // if (h - i > 0 && j > 0) tmp *= fac[(h - i) + j];
            tmp *= waf[i][w - j];
            tmp *= waf[h - i][j];
            pre[h][w] += tmp;
          }
        }
      }
      
      Mint ans;
      /*
      foreach (p; 0 .. 1 << H) {
        alias Entry = Tuple!(int, "row", int, "col");
        Entry[] es;
        foreach (x0; 0 .. H) foreach (x1; 0 .. H) {
          if ((p & 1 << x0) && (p & 1 << x1)) {
            foreach (y0; 0 .. W) foreach (y1; 0 .. W) {
              if (A[x0][y0] == '.' &&
                  A[x0][y1] == '#' &&
                  A[x1][y0] == '#' &&
                  A[x1][y1] == '.') {
                es ~= Entry(1 << x0 | 1 << x1, 1 << y0 | 1 << y1);
              }
            }
          }
        }
        foreach (q; 0 .. 1 << W) {
          int pp, qq;
          foreach (ref e; es) {
            if ((q & e.col) == e.col) {
              pp |= e.row;
              qq |= e.col;
            }
          }
          if (p == pp && q == qq) {
            const h = H - popcnt(p);
            const w = W - popcnt(q);
            debug {
              // writeln(p, " ", q, "; ", h, " ", w, ": ", pre[h][w]);
            }
            assert((h == H) == (w == W));
            ans += pre[h][w];
          }
        }
      }
      */
      
      auto rows = new int[H];
      auto cols = new int[W];
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        if (A[x][y] == '#') {
          rows[x] |= 1 << y;
          cols[y] |= 1 << x;
        }
      }
      foreach (p; 0 .. 1 << H) foreach (q; 0 .. 1 << W) {
        bool ok = true;
        foreach (x; 0 .. H) {
          if (p & 1 << x) {
            ok = ok && ((rows[x] & q) != 0 && (rows[x] & q) != q);
          }
        }
        foreach (y; 0 .. W) {
          if (q & 1 << y) {
            ok = ok && ((cols[y] & p) != 0 && (cols[y] & p) != p);
          }
        }
        if (ok) {
          const h = H - popcnt(p);
          const w = W - popcnt(q);
          debug {
            // writeln(p, " ", q, "; ", h, " ", w, ": ", pre[h][w]);
          }
          assert((h == H) == (w == W));
          ans += pre[h][w];
        }
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
