#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

  const ll MOD = 1e9+7;
  int n, m;
  cin >> n >> m;
  vector<string> v(n);
  for (auto& x : v) cin >> x;
  vector<int> dx = {-1, 1, 0, 0};
  vector<int> dy = {0, 0, -1, 1};
  ll ans = 1;
  for (int i =0; i < n; i++) {
    for (int j =0; j < m; j++) {
      bool ok = true;
      for (int k =0; k < 4; k++) {
        int ni = i + dx[k], nj = j + dy[k];
        if (ni < 0 || ni >= n || nj < 0 || nj >= m) continue;
        if (v[ni][nj] != v[i][j]) ok= false;
      }
      if (ok) ans = ans * 2 % MOD;
    }
  }
  cout << ans << '\n';
}