#include<iostream>
#include<string>

using namespace std;
typedef long long LL;
const LL mod=(LL)1e9+7;
bool ch[100][100][2];
bool ic[100][2];
string ms[100];
#define re(q,w) for(int (q)=0;(q)<(w);(q)++)
int H,W;
int checkICHIMATSU(){
	LL res=1;
	re(i,H)
		re(bb,2){
			int b=bb;
			bool f;
			f=true;
			re(j,W-1){
				f&=(ch[i][j][b]&&ch[i][j+1][1-b]);
				b=1-b;
			}
			ic[i][bb]=f;
		}
	re(i,H){
		int cnt=0;
		re(b,2)if(ic[i][b])cnt++;
		res=(res*cnt)%mod;
	}

	re(bb,2){
		int b=bb;
		bool f=true;
		re(i,H-1){
			f&=(ic[i][b]&&ic[i+1][1-b]);
			b=1-b;
		}
		if(f)res--;
	}
	if(res<0)res+=mod;
	return res;
}
int main(){
	cin>>H>>W;
	re(i,H)cin>>ms[i];
	re(i,H)for(int j=0;j<W;j++)ch[i][j][0]=(ms[i][j]!='1'),ch[i][j][1]=(ms[i][j]!='0');
	LL x=checkICHIMATSU();
	re(j,W)for(int i=H-2;i>=0;i--)re(b,2)ch[i][j][b]&=ch[i+1][j][1-b];
	LL res=1;
	re(i,H){
		int cnt=0;
		re(b,2)if(ch[0][i][b])cnt++;
		res=(res*cnt)%mod;
	}
	cout<<(res+x)%mod<<endl;
	return 0;
}