#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)

const int MOD = 1e9 + 7;

struct mint {
    int n;
    mint(int n_ = 0) : n(n_) {}
};

mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }

mint mpow(mint a, int b) {
  mint ans = 1;
  REP(i, b) ans *= a;
  return ans;
}

int main() {
  int H, W;
  cin >> H >> W;
  vector<string> S(H);
  REP(i, H) cin >> S[i];
  mint ans = 1;
  REP(i, H) {
    int x = 1;
    int y = 1;
    REP(j, W) {
      if (S[i][j] == '?') continue;
      x &= S[i][j] - '0' == (j + 0) % 2;
      y &= S[i][j] - '0' == (j + 1) % 2;
    }
    ans *= x + y;
  }
  bool can = true;
  REP(i, H) REP(j, W) REP(k, H) {
    if (S[k][j] == '?' || S[i][j] == '?') continue;
    if ((S[k][j] + S[i][j] + k + i) % 2 != 0) {
      can = false;
    }
  }
  if (can) {
    int c = 0;
    REP(j, W) {
      bool all = true;
      REP(i, H) all &= S[i][j] == '?';
      c += all;
    }
    ans += mpow(2, c);
    int x = 1;
    int y = 1;
    REP(i, H) REP(j, W) {
      if (S[i][j] == '?') continue;
      x &= S[i][j] - '0' == (i + j + 0) % 2;
      y &= S[i][j] - '0' == (i + j + 1) % 2;
    }
    ans -= x + y;
  }
  cout << ans.n << '\n';
}