#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
constexpr static struct PositiveInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::max() / 2; } constexpr auto operator-() const; } inf;  // NOLINT
constexpr static struct NegativeInfinity { template<typename T> constexpr operator T() const { return numeric_limits<T>::lowest() / 2; } constexpr auto operator-() const; } NegativeInfinityVal;
constexpr auto PositiveInfinity::operator-() const { return NegativeInfinityVal; }
constexpr auto NegativeInfinity::operator-() const { return inf; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin >> h >> w;
    auto a = make_v(h, w, '.');
    rep(i, 0, h) {
        rep(j, 0, w) {
            cin >> a[i][j];
        }
    }

    auto dp = make_v(h, w, h * w + 1, 0);
    dp[0][0][1] = 1;
    rep(i, 0, h) {
        rep(j, 0, w) {
            if (a[i][j] == '#')
                continue;
            rep(k, 0, h * w + 1) {
                if (i + 1 < h) {
                    if (a[i + 1][j] == 'o') {
                        dp[i + 1][j][k + 1] += dp[i][j][k];
                    }
                    if (a[i + 1][j] == 'x' && k > 0) {
                        dp[i + 1][j][k - 1] += dp[i][j][k];
                    }
                }
                if (j + 1 < w) {
                    if (a[i][j + 1] == 'o') {
                        dp[i][j + 1][k + 1] += dp[i][j][k];
                    }
                    if (a[i][j + 1] == 'x' && k > 0) {
                        dp[i][j + 1][k - 1] += dp[i][j][k];
                    }
                }
            }
        }
    }

    ll ans = 0;
    rep(i, 0, h * w + 1) {
        ans += dp[h - 1][w - 1][i];
    }
    print(ans);

    return 0;
}