#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int h, w; cin >> h >> w;
  vector<string> a(h);
  for (string& a_i : a) cin >> a_i;
  vector dp(h, vector(w, vector(h * w + 1, 0LL)));
  dp[0][0][1] = 1;
  REP(i, h) REP(j, w) {
    if (a[i][j] == '#') continue;
    if (i > 0) {
      REP(k, h * w + 1) {
        const int num = k + (a[i][j] == 'o' ? 1 : -1);
        if (0 <= num && num <= h * w) dp[i][j][num] += dp[i - 1][j][k];
      }
    }
    if (j > 0) {
      REP(k, h * w + 1) {
        const int num = k + (a[i][j] == 'o' ? 1 : -1);
        if (0 <= num && num <= h * w) dp[i][j][num] += dp[i][j - 1][k];
      }
    }
  }
  cout << reduce(dp[h - 1][w - 1].begin(), dp[h - 1][w - 1].end(), 0LL) << '\n';
  return 0;
}