#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) < (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pcnt __builtin_popcount
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<long long,int>;
using LP = pair<long long,long long>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 1'100'000'000;
const long long LINF = 1'100'000'000'000'000'000LL;
const double DINF = 2e18;
const int di[] = {1,0,0,-1,-1,1,-1,1};
const int dj[] = {0,1,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok,const string& s="Yes",const string& t="No") {if(ok)cout<<s<<endl;else cout<<t<<endl;}


//-----def end-----//


int main () {
    int h , w;
    cin >> h >> w;
    vector<string> s(h);
    rep(i , h) cin >> s[i];
    int res = 0;
    auto dfs = [&] (auto dfs , int i , int j , int cnt) {
        if(s[i][j] == 'o') cnt++;
        if(s[i][j] == 'x') {
            if(cnt == 0) return;
            else cnt--;
        }
        if(i == h-1 && j == w-1) {
            res++;
            return;
        }
        rep(v , 2) {
            int ni = i+di[v] , nj = j+dj[v];
            if(ni < 0 || nj < 0 || ni >= h || nj >= w) continue;
            if(s[i][j] == '#') continue;
            dfs(dfs , ni , nj , cnt);
        }
    };
    dfs(dfs , 0 , 0 , 0);
    cout << res << endl;
    return 0;
}