//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

// bit op
int popcnt(uint x) { return __builtin_popcount(x); }
int popcnt(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 - __builtin_clz(x); }
int bsr(ull x) { return 63 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }

struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        reverse(small, small + len);
        memcpy(line + pos, small, len);
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};


template <uint MD> struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
// using Mint = ModInt<998244353>;
// template<> const Mint Mint::G = Mint(3);


template<class Mint>
struct Comb {
    int max_n;
    V<Mint> fact, ifact;
    Comb(int n) : max_n(n) {
        fact = ifact = V<Mint>(n + 1);
        fact[0] = Mint(1);
        for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; i--) ifact[i - 1] = ifact[i] * i;
    }

    Mint C(int n, int k) {
        if (n < k || n < 0) return Mint(0);
        assert(0 <= k && k <= n && n <= max_n);
        return fact[n] * ifact[k] * ifact[n - k];
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

using Mint = ModInt<998244353>;
Comb<Mint> C(100);
using K = tuple<int, int, int, int>;

map<K, Mint> dp;
Mint calc(int n, int m, int a, int b) {
    if (n == 0 || m == 0) return Mint(1);
    K k = K{n, m, a, b};
    if (dp.count(k)) return dp[k];

    Mint ans = Mint(0);
    // w-w, b-b
    for (int f: {1, 2}) {
        if ((a & f) && (b & f)) {
            ans += Mint(1); // all same
            for (int i = 1; i < n; i++) {
                for (int j = 1; j < m; j++) {
                    ans += C.C(n, i) * C.C(m, j) * calc(n - i, m - j, 3^f, 3^f);
                }
            }
        }
    }
    for (int ph = 0; ph < 2; ph++) {
        // w-b
        if (a == 3) {
            for (int i = 1; i <= n; i++) {
                for (int j = 1; i + j <= n; j++) {
                    ans += C.C(n, i) * C.C(n - i, j) * calc(n - i - j, m, 0, 3);
                }
            }
        }
        // w-., b-.
        for (int f: {1, 2}) {
            if (a & f) {
                for (int i = 1; i < n; i++) {
                    ans += C.C(n, i) * calc(n - i, m, 0, 3^f);
                }
            }
        }
        swap(n, m);
        swap(a, b);
    }
    return dp[k] = ans;
}

Mint dpx[100][100];
bool visx[100][100];
Mint calcx(int a, int b) {
    if (a == 0 || b == 0) return Mint(1);
    if (visx[a][b]) return dpx[a][b];
    visx[a][b] = true;
    Mint ans = Mint(0);
    for (int i = 1; i <= a; i++) {
        ans += C.C(a, i) * calcx(b, a - i);
    }
    return dpx[a][b] = ans;
}

Mint calc2(int a, int b) {
    if (a == 0 || b == 0) return Mint(1);
    assert(0 <= a && 0 <= b);
    return calcx(a, b) + calcx(b, a);
}

int main() {
    int h, w;
    sc.read(h, w);
    V<int> ng(h), rg(w);
    for (int i = 0; i < h; i++) {
        string s;
        sc.read(s);
        for (int j = 0; j < w; j++) {
            if (s[j] == '#') {
                ng[i] |= (1 << j);
                rg[j] |= (1 << i);
            }
        }
    }

    Mint ans = calc(h, w, 3, 3);
    VV<int> cnt(h, V<int>(w, 0));
    for (int f = 1; f < (1 << h); f++) {
        for (int g = 1; g < (1 << w); g++) {
            bool ok = true;
            for (int i = 0; i < h; i++) {
                if (!(f & (1 << i))) continue;
                int u = ng[i] & g;
                if (u == 0 || u == g) {
                    ok = false;
                    break;
                }
            }
            for (int i = 0; i < w; i++) {
                if (!(g & (1 << i))) continue;
                int u = rg[i] & f;
                if (u == 0 || u == f) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                int u = popcnt(uint(f)), v = popcnt(uint(g));
                cnt[h - u][w - v]++;
                         ;
            }
        }
    }
            ;
    for (int r = 0; r < h; r++) {
        for (int c = 0; c < w; c++) {
            for (int i = 0; i <= r; i++) {
                for (int j = 0; j <= c; j++) {
                    ans += Mint(cnt[r][c]) * C.C(r, i) * C.C(c, j) * calc2(i, c - j) * calc2(r - i, j);
                }
            }
        }
    }
    pr.writeln(ans.v);

    return 0;
}


Measured memory_bytes: 384