import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable MO = 1000000007L;

int M, N;
string[] S;

void main() {
  try {
    for (; ; ) {
      M = readInt();
      N = readInt();
      S = new string[M];
      foreach (x; 0 .. M) {
        S[x] = readToken();
      }
      
      long ans;
      
      // x + f(y)
      {
        long prod = 1;
        foreach (y; 0 .. N) {
          auto ok = [true, true];
          foreach (x; 0 .. M) {
            if (S[x][y] != '?') {
              foreach (t; 0 .. 2) {
                ok[t] = ok[t] && (S[x][y] == "01"[(x + t) % 2]);
              }
            }
          }
          debug {
            writeln("  ", ok);
          }
          (prod *= ok.count(true)) %= MO;
        }
        debug {
          writeln("  ", prod);
        }
        ans += prod;
      }
      
      // f(x) + y
      {
        long prod = 1;
        foreach (x; 0 .. M) {
          auto ok = [true, true];
          foreach (y; 0 .. N) {
            if (S[x][y] != '?') {
              foreach (t; 0 .. 2) {
                ok[t] = ok[t] && (S[x][y] == "01"[(t + y) % 2]);
              }
            }
          }
          (prod *= ok.count(true)) %= MO;
        }
        ans += prod;
      }
      
      // x + y, x + y + 1
      {
        auto ok = [true, true];
        foreach (x; 0 .. M) foreach (y; 0 .. N) {
          if (S[x][y] != '?') {
            foreach (t; 0 .. 2) {
              ok[t] = ok[t] && (S[x][y] == "01"[(x + y + t) % 2]);
            }
          }
        }
        ans -= ok.count(true);
      }
      
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}