#include<bits/stdc++.h>
using namespace std;

//typedef
typedef unsigned int UINT;
typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> PLL;
typedef tuple<LL, LL, LL> TLL3;
typedef tuple<LL, LL, LL, LL> TLL4;
typedef set<LL, greater<LL> > setdownLL;
#define PQ priority_queue
typedef PQ<LL, vector<LL>, greater<LL> > pqupLL;
//container utill
#define ALL(v) (v).begin(),(v).end()
#define CR [](auto element1, auto element2){return element1>element2;}
#define LB lower_bound
#define UP upper_bound
#define PB push_back
#define MP make_pair
#define MT make_tuple
//constant
#define PI 3.141592653589793

const LL MOD=1000000007;

int main(){
    //input
    LL H,W;
    cin >> H >> W;
    string gri[H];
    LL i,j,k;
    for(i=0; i<H; i++){
        cin >> gri[i];
    }

    bool vercan=1, horcan=1;
    

    char num;
    //check vertical
    for(j=0; j<W; j++){
        for(i=0; i<H; i++){
            if(gri[i][j]!='?'){
                num=gri[i][j];
                for(k=i+1; k<H; k++){
                    if(gri[k][j]!='?'){
                        if(((k-i)%2)==0&&gri[k][j]!=gri[i][j]){
                            vercan=0;
                        }
                        if(((k-i)%2)==1&&gri[k][j]==gri[i][j]){
                            vercan=0;
                        }
                    }
                }
                i=H-1;
            }
        }
    }
    //check horizontal
    for(i=0; i<H; i++){
        for(j=0; j<W; j++){
            if(gri[i][j]!='?'){
                num=gri[i][j];
                for(k=j+1; k<W; k++){
                    if(gri[i][k]!='?'){
                        if(((k-j)%2)==0&&gri[i][k]!=gri[i][j]){
                            horcan=0;
                        }
                        if(((k-j)%2)==1&&gri[i][k]==gri[i][j]){
                            horcan=0;
                        }
                    }
                }
                j=W-1;
            }
        }
    }
    
    bool zerotile=1, onetile=1;
    //check zerotile
    for(i=0; i<H; i++){
        for(j=0; j<W; j++){
            if(gri[i][j]!='?'){
                if(gri[i][j]!='0'+((i+j)%2)){
                    zerotile=0;
                }
            }
        }
    }
    //check onetile
    for(i=0; i<H; i++){
        for(j=0; j<W; j++){
            if(gri[i][j]!='?'){
                if(gri[i][j]!='0'+((i+j+1)%2)){
                    onetile=0;
                }
            }
        }
    }

    LL ans=0, val;
    bool que;
    //add when vertical
    if(vercan==1){
        val=1;
        for(j=0; j<W; j++){
            que=1;
            for(i=0; i<H; i++){
                if(gri[i][j]!='?'){
                    que=0;
                }
            }
            if(que==1){
                val*=2;
                val%=MOD;
            }
        }
        ans+=val;
        ans%=MOD;
    }
    //add when horizontal
    if(horcan==1){
        val=1;
        for(i=0; i<H; i++){
            que=1;
            for(j=0; j<W; j++){
                if(gri[i][j]!='?'){
                    que=0;
                }
            }
            if(que==1){
                val*=2;
                val%=MOD;
            }
        }
        ans+=val;
        ans%=MOD;
    }

    //remove multiple
    if(zerotile==1){
        ans+=(MOD-1);
        ans%=MOD;
    }
    if(onetile==1){
        ans+=(MOD-1);
        ans%=MOD;
    }

    //output
    cout << ans << endl;
    return 0;
}