#include<bits/stdc++.h>
const int N = 2005;
const int mod = 1e9 + 7;
using pr = std::pair<int, int>;
using std::cin;
using std::cout;
int n, m;
int a[N][N];
int vis[N][N];
std::vector<pr> o;
void bfs(int x, int y, int c) {
	auto push = [&](int x, int y) {
		if(x < 1 || x > n) return ;
		if(y < 1 || y > m) return ;
		if(!vis[x][y] && a[x][y] == c) {
			vis[x][y] = 1;
			o.emplace_back(x, y);
		}
	};
	push(x, y);
	for(int i = 0;i < (int) o.size();++i) {
		auto [a, b] = o[i];
		push(a - 1, b);
		push(a + 1, b);
		push(a, b - 1);
		push(a, b + 1);
	}
}
int main() {
	cin >> n >> m;
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j <= m;++j) {
			char c; cin >> c;
			a[i][j] = c == 'B';
		}
	}
	int ans = 1;
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j <= m;++j) if(!vis[i][j]) {
			bfs(i, j, a[i][j]);
			int cnt = o.size();
			auto test = [&](int x, int y) -> bool {
				if(x < 1 || x > n) return 0;
				if(y < 1 || y > m) return 0;
				return a[x][y] != a[i][j];
			};
			for(auto [x, y] : o) {
				cnt -= test(x - 1, y) || test(x + 1, y) || test(x, y - 1) || test(x, y + 1);
			}
			o.clear();
			for(int j = 0;j < cnt;++j) ans = ans * 2u % mod;
		}
	}
	cout << ans << '\n';
}