/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.10.20 16:26:22
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

template< int MOD >
struct mint {
public:
    long long x;
    mint(long long x = 0) :x((x%MOD+MOD)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-() const {return mint() -= *this; }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    friend std::istream &operator>>(std::istream &is, mint &n) {
        long long x;
        is >> x;
        n = mint(x);
        return is;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
    mint pow(long long k) const {
        mint ret = 1;
        mint p = this->x;
        while (k > 0) {
            if (k & 1) {
                ret *= p;
            }
            p *= p;
            k >>= 1;
        }
        return ret;
    }
};
constexpr int MOD = 1e9 + 7;
int main() {
    int h,w;cin >> h >> w;
    vector<string> s(h);
    for (int i = 0; i < h; i++) {
        cin >> s[i];
    }
    mint<MOD> ans = 0;
    bool ok = true;
    int cnt = 0;
    for (int i = 0; i < h; i++) {
        int c = -1;
        for (int j = 0; j < w; j++) {
            if (c == -1 && s[i][j] != '?') {
                c = (s[i][j] == '0' ? j%2 : 1 - j%2);
            }
            else if (s[i][j] != '?' && c >= 0 && ((s[i][j]-'0') ^ (j%2)) != c) {
                c = -2;
                break;
            }
        }
        
        if (c == -2) {
            ok = false;
            break;
        }
        else if (c == -1) {
            cnt++;
        }
    }
    if (ok) ans += mint<MOD>(2).pow(cnt);
    ok = true;
    cnt = 0;
    for (int j = 0; j < w; j++) {
        int c = -1;
        for (int i = 0; i < h; i++) {
            if (c == -1 && s[i][j] != '?') {
                c = (s[i][j] == '0' ? i%2 : 1 - i%2);
            }
            else if (s[i][j] != '?' && c >= 0 && ((s[i][j]-'0') ^ (i%2)) != c) {
                c = -2;
                break;
            }
        }
        
        if (c == -2) {
            ok = false;
            break;
        }
        else if (c == -1) {
            cnt++;
        }
    }
    if (ok) ans += mint<MOD>(2).pow(cnt);
    int t = -1;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (t == -1 && s[i][j] != '?') {
                t = (s[i][j] == '0' ? (i+j)%2:1-(i+j)%2);
            }
            else if (s[i][j] != '?' && t >= 0 && ((s[i][j]-'0') ^ ((i+j)%2)) != t) {
                t = -2;
                break;
            }
        }
        if (t == -2) {
            break;
        }
    }
    if (t != -2) {
        ans -= 1;
    }
    cout << ans << endl;
    return 0;
}