#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

long long modpow(long long x, long long n, long long MOD) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = ret * x % MOD;  // n の最下位bitが 1 ならば x^(2^i) をかける
        x = x * x % MOD;
        n >>= 1;  // n を1bit 左にずらす
    }
    return ret;
}

using mint = modint1000000007;

mint solve(vector<vector<char>> &s){
    int H = s.size(), W = s[0].size();
    int cnt = 0;
    for(int j=0;j<W;j++){
        set<int> st;
        for(int i=0;i<H;i++){
            if (s[i][j] == '0') st.insert((i % 2));
            if (s[i][j] == '1') st.insert(1 - (i % 2));
        }
        if (st.size() == 2) return mint(0);
        if (st.size() == 0) cnt++;
    }
    return mint(modpow(2,cnt,1e9+7));
}

bool ichimatsu1(vector<vector<char>> &s){
    int H = s.size(), W = s[0].size();
    rep(i,H)rep(j,W){
        if ((i + j) % 2 == 0 && s[i][j] == '0') return false;
        if ((i + j) % 2 == 1 && s[i][j] == '1') return false;
    }
    return true;
}

bool ichimatsu0(vector<vector<char>> &s){
    int H = s.size(), W = s[0].size();
    rep(i,H)rep(j,W){
        if ((i + j) % 2 == 0 && s[i][j] == '1') return false;
        if ((i + j) % 2 == 1 && s[i][j] == '0') return false;
    }
    return true;
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int H,W; cin >> H >> W;
    vector<vector<char>> s(H,vector<char>(W));
    vector<vector<char>> t(W,vector<char>(H));
    rep(i,H)rep(j,W) cin >> s[i][j];
    rep(j,W)rep(i,H) t[j][i] = s[i][j];
    debug(s,t);
    mint res = solve(s);
    res += solve(t);
    if (ichimatsu0(s)) res--;
    if (ichimatsu1(s)) res--;
    cout << res << endl;
}