#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<int MOD>
class ModInt{
public:
    ModInt():value(0){}
    ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ }

    ModInt& operator+=(ModInt that){
        value = value+that.value;
        if(value>=MOD)value-=MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that){
        value -= that.value;
        if(value<0)value+=MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that){
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that){
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const{
        return ModInt(*this)+=that;
    }
    ModInt operator-(ModInt that) const{
        return ModInt(*this)-=that;
    }
    ModInt operator*(ModInt that) const{
        return ModInt(*this)*=that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const{
        if(value == 0)return 0;
        ModInt n = *this, res = 1;
        while(k){
            if(k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while(b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const{ return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x){
    os << x.toi();
    return os;
}

string nstr(){
    static const int MAX_LEN = 101;
    static char res_[MAX_LEN];
    scanf("%s",res_);
    return string(res_);
}

int H, W;
vector<string> S;
// i列目まで見た、連続が存在した、前の列の値
mint dp[1001][2][2];

void solve(){
    string A(W, '0'), B(W, '0');
    rep(i, W){
        if(i & 1)A[i] = '1';
        else B[i] = '1';
    }

    mint ans = 1;
    rep(y, H){
        int okA = 1, okB = 1;
        rep(x, W){
            if(S[y][x] == '?')continue;
            if(S[y][x] != A[x])okA = 0;
            if(S[y][x] != B[x])okB = 0;
        }
        ans *= okA + okB;
    }

    rep(i, W + 1)rep(j, 2)rep(k, 2)dp[i][j][k] = 0;
    if(S[0][0] == '?')dp[1][0][0] = dp[1][0][1] = 1;
    else dp[1][0][S[0][0] - '0'] = 1;

    FOR(x, 1, W){
        vi curs;
        if(S[0][x] != '1')curs.push_back(0);
        if(S[0][x] != '0')curs.push_back(1);
        rep(suc, 2){
            rep(pre, 2){
                each(cur, curs){
                    int hoge = pre, piyo = cur;
                    bool ok = true;
                    rep(y, H){
                        ok &= S[y][x - 1] == '?' || S[y][x - 1] - '0' == hoge;
                        ok &= S[y][x] == '?' || S[y][x] - '0' == piyo;
                        if(!ok)break;
                        hoge = 1 - hoge;
                        piyo = 1 - piyo;
                    }
                    if(ok)dp[x + 1][suc | (pre == cur)][cur] += dp[x][suc][pre];
                }
            }
        }
    }
    ans += dp[W][1][0] + dp[W][1][1];

    cout << ans << endl;
}

int main(){
    while(cin >> H >> W){
        S.resize(H);
        rep(i, H)S[i] = nstr();
        solve();
    }
}