#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

vector<string> rot(int H, int W, vector<string>& a) {
	vector<string> b(W, string(H, ' '));
	for (int i = 0; i < H; i++)
		for (int j = 0; j < W; j++)
			b[j][i] = a[i][j];
	return b;
}

int f(int H, int W, vector<string>& a) {
	vector<int> b(W);
	for (int i = 0; i < H; i++)
		for (int j = 0; j < W; j++)
			if (i % 2 == 0) {
				if (a[i][j] == '0') b[j] |= 1;
				if (a[i][j] == '1') b[j] |= 2;
			}
			else {
				if (a[i][j] == '0') b[j] |= 2;
				if (a[i][j] == '1') b[j] |= 1;
			}
	int p = 1;
	for (int j = 0; j < W; j++) {
		if (b[j] == 0) p = p * 2 % MOD;
		if (b[j] == 3) p = 0;
	}
	return p;
}



int main() {
	int H, W; cin >> H >> W;
	vector<string> a(H);
	for (int i = 0; i < H; i++)
		cin >> a[i];
	vector<string> b = rot(H, W, a);
	int ans = (f(H, W, a) + f(W, H, b)) % MOD;
	int x = 0, y = 0;
	for (int i = 0; i < H; i++)
		for (int j = 0; j < W; j++)
			if ((i + j) % 2 == 0) {
				if (a[i][j] == '0') x |= 1;
				if (a[i][j] == '1') x |= 2;
			}
			else {
				if (a[i][j] == '0') y |= 1;
				if (a[i][j] == '1') y |= 2;
			}
	if (((x & 1) == 0) && ((y & 2) == 0)) ans--;
	if (((x & 2) == 0) && ((y & 1) == 0)) ans--;
	ans = (ans + MOD) % MOD;
	cout << ans << endl;
}