#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

vector<string> rev(vector<string> s) {
	int h = s.size(), w = s[0].size();
	vector<string> res(w);
	rep(i, w) {
		res[i].resize(h);
		rep(j, h) {
			res[i][j] = s[j][i];
		}
	}
	return res;
}
modint calc(vector<string> s) {
	int h = s.size(), w = s[0].size();
	modint res = 1;
	rep(j, w) {
		bool exi[2] = {};
		rep(i, h-1) {
			if (s[i][j]!='?'&&s[i][j] == s[i + 1][j]) {
				return 0;
			}
		}
		rep(i, h) {
			if (s[i][j] != '?') {
				int z = s[i][j] - '0';
				if (i % 2)z ^= 1;
				exi[z] = true;
			}
		}
		if (exi[0] && exi[1])return 0;
		if (!exi[0] && !exi[1])res *= 2;
	}
	return res;
}
void solve() {
	int h, w; cin >> h >> w;
	vector<string> s(h);
	rep(i, h)cin >> s[i];

	modint ans = calc(s);
	//cout << "? " << calc(s) << "\n";
	s = rev(s);
	ans += calc(s);
	s = rev(s);
	bool exi[2] = {};
	rep(i, h)rep(j, w) {
		if (s[i][j] != '?') {
			int z = s[i][j] - '0';
			if ((i + j) % 2)z ^= 1;
			exi[z] = 1;
		}
	}
	if (exi[0] && exi[1]) {
		//
	}
	else if (exi[0] || exi[1]) {
		ans -= 1;
	}
	else ans -= 2;
	cout << ans << "\n";
}





signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}