#include <bits/stdc++.h>
using ll = long long;
constexpr ll MOD = 1000000007;
int main()
{
    int H, W;
    std::cin >> H >> W;
    std::vector<std::string> S(H);
    for (int i = 0; i < H; i++) { std::cin >> S[i]; }
    ll ans = 1;
    for (int i = 0; i < H; i++) {
        bool odd = false, even = false;
        for (int j = 0; j < W; j++) {
            if (S[i][j] == '0') {
                (j % 2 == 0 ? even : odd) = true;
            } else if (S[i][j] == '1') {
                (j % 2 == 1 ? even : odd) = true;
            }
        }
        (ans *= (2 - odd - even)) %= MOD;
    }
    std::vector<ll> p(W + 1, 1);
    for (int i = 1; i <= W; i++) { p[i] = p[i - 1] * 2 % MOD; }
    auto solve = [&]() {
        std::string top(W, '?');
        bool odd = true, even = true;
        int h = W;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (S[i][j] != '?') {
                    const char c = (i % 2 == 0 ? S[i][j] : '0' + ('1' - S[i][j]));
                    if (top[j] != '?' and top[j] != c) { return 0LL; }
                    h -= (top[j] == '?' ? 1 : 0), top[j] = c;
                    if (c == '0') {
                        (j % 2 == 0 ? even : odd) = false;
                    } else {
                        (j % 2 == 1 ? even : odd) = false;
                    }
                }
            }
        }
        return (p[h] + MOD - even - odd) % MOD;
    };
    std::cout << (ans + solve()) % MOD << std::endl;
    return 0;
}