#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

const int MAX = 1000000;
const int MOD = 998244353;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int modpow(ll a, ll n, ll p){
	if(n==0) return 1;
	if(n%2) return (a*modpow(a, n-1, p))%p;
	if(!(n%2)){
		ll t=modpow(a, n/2, p);
		return (t*t)%p;
	}
}


int main(){
  int h, w; cin >> h >> w; string s[h];
  rep(i, h){
    cin >> s[i];
  }
  ll ansa = 1;
  rep(i, h){
    bool gu = false, ki = false; int cnt = 0;
    rep(j, w){
      if(s[i][j]=='1' && j%2) ki = true;
      else if(s[i][j]=='1' && j%2==0) gu = true;
      else if(s[i][j]=='0' && j%2==0) ki = true;
      else if(s[i][j]=='0' && j%2) gu = true;
    }
    //cout << ki << " " << gu << " " << i << endl;
    if(ki&&gu){
      ansa = 0; break;
    }
    if(!ki && !gu) ansa*=2;
    ansa%=mod;
  }
  ll ansb = 1;
   rep(j, w){
    bool gu = false, ki = false; int cnt = 0;
    rep(i, h){
      if(s[i][j]=='1' && i%2) ki = true;
      else if(s[i][j]=='1' && i%2==0) gu = true;
      else if(s[i][j]=='0' && i%2==0) ki = true;
      else if(s[i][j]=='0' && i%2) gu = true;
    }
    if(ki&&gu){
      ansb = 0;  break;
    }
    if(!ki && !gu){
      ansb*=2; //cout << j << endl;
    }
    ansb%=mod;
  }
  char checka[h][w], checkb[h][w];
  bool a = true, b = true;
  //cout << ansa << " " << ansb << endl;
  rep(i, h){
    rep(j, w){
      if((i+j)%2==0){
        checka[i][j] = '0'; checkb[i][j] = '1';
      }
      else{
        checka[i][j] = '1'; checkb[i][j] = '0';
      }
      if(checka[i][j]!=s[i][j] && s[i][j]!='?') a = false;
      if(checkb[i][j]!=s[i][j] && s[i][j]!='?') b = false;
    }
  }
  cout << ((ansa+ansb)%mod-a-b+mod)%mod << endl;
}