#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= x;
    x *= x;
    n >>= 1;
  }
  return res;
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}

const i64 inf = 1ll << 60;

void _main() {
  i64 h, w;
  cin >> h >> w;
  vector<string> a(h);
  for (i64 i = 0; i < h; i++) {
    cin >> a[i];
  }
  vector<vector<vector<i64>>> dp(h,
                                 vector<vector<i64>>(w, vector<i64>(100, 0)));
  dp[0][0][1] = 1;
  for (i64 i = 0; i < h; i++) {
    for (i64 j = 0; j < w; j++) {
      for (i64 k = 0; k < 100; k++) {
        if (a[i][j] == '#') {
          dp[i][j][k] = 0;
        } else if (a[i][j] == 'o' && k > 0) {
          if (i > 0) {
            dp[i][j][k] += dp[i - 1][j][k - 1];
          }
          if (j > 0) {
            dp[i][j][k] += dp[i][j - 1][k - 1];
          }
        } else if (a[i][j] == 'x' && k < 99) {
          if (i > 0) {
            dp[i][j][k] += dp[i - 1][j][k + 1];
          }
          if (j > 0) {
            dp[i][j][k] += dp[i][j - 1][k + 1];
          }
        }
      }
    }
  }
  i64 cnt = 0;
  for (i64 k = 0; k < 100; k++) {
    cnt += dp[h - 1][w - 1][k];
  }
  cout << cnt << "\n";
}