#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


char buf[110];

int N, M;
string S[1010];

Mint pw2[1010], pw3[1010];

int R[1010];
int F[1010][110][2];
using BS = bitset<1010>;
BS G[40][4];
BS H[1 << 16][4];

Mint crt[1 << 17], nxt[1 << 17];

/*
  0-> 0101  
  1-> 0011  
           3
      o    3
       o   3
      oo   2
        o  3
      o o  2
       oo  1
      ooo  1
         o 3
      o  o 1
       o o 2
      oo o 1
        oo 2
      o oo 1
       ooo 1
      oooo 1
*/
int numAll;
BS all;
Mint calc(BS *hs) {
  const BS h1 = (hs[0] & hs[3]) | (hs[1] & hs[2]);
  const BS h2 = (hs[0] | hs[3]) & (hs[1] | hs[2]);
  const int num1 = h1.count();
  const int num2 = (h2 & ~h1).count();
  const int num3 = numAll - num1 - num2;
  return pw2[num2] * pw3[num3];
}

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    for (int i = 0; i < M; ++i) {
      scanf("%s", buf);
      S[i] = buf;
    }
    
    pw2[0] = 1;
    pw3[0] = 1;
    for (int i = 1; i <= M; ++i) {
      pw2[i] = pw2[i - 1] * 2;
      pw3[i] = pw3[i - 1] * 3;
    }
    
    for (int i = 0; i < M; ++i) {
      for (int j = 0; j < N; ++j) {
        for (int x = 0; x < 2; ++x) F[i][j][x] = x;
      }
      {
        int j = 0;
        for (const char s : S[i]) {
          switch (s) {
            case 'R': {
              ++j;
            } break;
            case '0': {
              for (int x = 0; x < 2; ++x) F[i][j][x] = 0;
            } break;
            case '1': {
              for (int x = 0; x < 2; ++x) F[i][j][x] = 1;
            } break;
            case '*': {
              for (int x = 0; x < 2; ++x) F[i][j][x] ^= 1;
            } break;
            default: assert(false);
          }
        }
        R[i] = j + 1;
      }
// cerr<<S[i]<<": "<<R[i]<<"; ";for(int j=0;j<N;++j)cerr<<F[i][j][0]<<","<<F[i][j][1]<<" ";cerr<<endl;
    }
    
    numAll = 0;
    all.reset();
    for (int j = 0; j < N; ++j) for (int f = 0; f < 4; ++f) {
      G[j][f].reset();
    }
    vector<vector<int>> iss(N + 1);
    for (int i = 0; i < M; ++i) if (R[i] <= N) {
      iss[R[i]].push_back(i);
    }
    
    Mint ans = 0;
    // fix n: max startpos
    for (int n = N; --n >= 0; ) {
// cerr<<"n = "<<n<<endl;
      // only consider robots with R[i] <= r
      const int r = N - n;
      for (const int i : iss[r]) {
// cerr<<"  add "<<i<<endl;
        ++numAll;
        all.set(i);
        for (int j = 0; j < N; ++j) {
          G[j][F[i][j][0] | F[i][j][1] << 1].set(i);
        }
      }
      if (n <= r) {
        // O*(2^n)
        vector<Mint> prods(1 << n, 1);
        for (int l = 0; l < N; ++l) {
          {
            const int j = l - n;
            if (0 <= j && j < N) {
              for (int f = 0; f < 4; ++f) H[0][f] = G[j][f];
            } else {
              for (int f = 0; f < 4; ++f) H[0][f].reset();
              H[0][2] = all;
            }
          }
          for (int k = 0; k < n; ++k) {
            const int j = l - (n - (k + 1));
            if (0 <= j && j < N) {
              for (int p = 0; p < 1 << k; ++p) {
                for (int f = 0; f < 4; ++f) H[p | 1 << k][f] = H[p][f] | G[j][f];
              }
            } else {
              for (int p = 0; p < 1 << k; ++p) {
                for (int f = 0; f < 4; ++f) H[p | 1 << k][f] = H[p][f];
                H[p | 1 << k][2] |= all;
              }
            }
          }
          for (int p = 0; p < 1 << n; ++p) {
            prods[p] *= calc(H[p]);
          }
        }
        for (int p = 0; p < 1 << n; ++p) {
          ans += (__builtin_parity(p)?-1:+1) * prods[p];
        }
      } else {
        // O*(2^r)
        fill(crt, crt + (1 << (r+1)), 0);
        crt[0] = 1;
        for (int l = 0; l < n; ++l) {
          // include startpos l ?
          fill(nxt, nxt + (1 << (r+1)), 0);
          for (int p = 0; p < 1 << r; ++p) {
            nxt[p << 1    ] += crt[p];
            nxt[p << 1 | 1] -= crt[p];
            nxt[1 << r | p << 1    ] += crt[1 << r | p];
            nxt[1 << r | p << 1 | 1] -= crt[1 << r | p];
          }
          // cell l determined
          for (int f = 0; f < 4; ++f) H[0][f].reset();
          H[0][2] = all;
          for (int k = 0; k < r; ++k) {
            for (int p = 0; p < 1 << k; ++p) {
              for (int f = 0; f < 4; ++f) H[p | 1 << k][f] = H[p][f] | G[k][f];
            }
          }
          for (int p = 0; p < 1 << r; ++p) {
            const Mint res = calc(H[p]);
            nxt[p] *= res;
            nxt[p | 1 << r] *= res;
          }
          copy(nxt, nxt + (1 << (r+1)), crt);
        }
        // cell [n, N) determined
        for (int l = n; l < N; ++l) {
          {
            const int j = l - n;
            if (0 <= j && j < N) {
              for (int f = 0; f < 4; ++f) H[0][f] = G[j][f];
            } else {
              for (int f = 0; f < 4; ++f) H[0][f].reset();
              H[0][2] = all;
            }
          }
          for (int k = 0; k < r; ++k) {
            const int j = l - (n - (k + 1));
            if (0 <= j && j < N) {
              for (int p = 0; p < 1 << k; ++p) {
                for (int f = 0; f < 4; ++f) H[p | 1 << k][f] = H[p][f] | G[j][f];
              }
            } else {
              for (int p = 0; p < 1 << k; ++p) {
                for (int f = 0; f < 4; ++f) H[p | 1 << k][f] = H[p][f];
                H[p | 1 << k][2] |= all;
              }
            }
          }
          for (int p = 0; p < 1 << r; ++p) {
            crt[p] *= calc(H[p]);
            H[p][2] |= all;
            crt[p | 1 << r] *= calc(H[p]);
          }
        }
        for (int p = 0; p < 1 << (r+1); ++p) {
          ans += crt[p];
        }
      }
    }
    printf("%u\n", ans.x);
  }
  return 0;
}