#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int N = 1e6, MOD = 1e9 + 7;

int fa[N], mxi[N], dp[N];

int find(int x) {
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}

bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) {
        return false;
    }
    dp[x] = 1LL * dp[x] * dp[y] % MOD;
    fa[y] = x;
    mxi[x] = max(mxi[x], mxi[y]);
    return true;
}

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

    int n, m;
    cin >> n >> m;

    iota(fa, fa + N, 0);
    fill(dp, dp + N, 1);
    vector<string> s(n);

    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            mxi[i * m + j] = i;
        }
    }

    for (int i = n - 1; i >= 0; --i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == '.') {
                if (i + 1 < n && s[i + 1][j] == '.') {
                    unite(i * m + j, (i + 1) * m + j);
                }
                if (j + 1 < m && s[i][j + 1] == '.') {
                    unite(i * m + j, i * m + j + 1);
                }
            }
        }

        vector<int> h;

        for (int j = 0; j < m; ++j) {
            if (s[i][j] == '.') {
                h.push_back(find(i * m + j));
            }
        }

        sort(h.begin(), h.end());
        h.resize(unique(h.begin(), h.end()) - h.begin());

        for (int x : h) {
            if (++dp[x] == MOD) {
                dp[x] = 0;
            }
        }
    }

    int ans = 1;

    vector<int> h;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == '.') {
                h.push_back(find(i * m + j));
            }
        }
    }

    sort(h.begin(), h.end());
    h.resize(unique(h.begin(), h.end()) - h.begin());

    for (int x : h) {
        ans = 1LL * ans * dp[x] % MOD;
    }

    cout << ans << '\n';

    return 0;
}