#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cmath> 
#include <climits>
#include <functional>
#include <iomanip>
#include <limits>
#include <cassert>
#include <random>
#include <complex>
#include <numeric>
#include <regex>
#include <list>
#include <ctime> 

using namespace std;

#define ll long long
#define ull unsigned long long
#define ld  long double
typedef vector<long long> vll;

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要)
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs(vis.assign忘れるな)
-SegTreedec,SegTreeLazydec
*/
ll H,W;
VS a;
bool valid(ll px, ll py){
    return (0 <= px && px < H && 0 <= py && py < W && a[px][py] != '#');
}

VL nex={0,1},ney={1,0};
ll ans=0;
void dfs(ll px, ll py, ll now){

    if(px == H-1 && py == W-1){
        if(now >= 0) ans++;
        return;
    }

    for(ll i = 0; i < 2; i++){
        ll nx,ny;
        nx = px+nex[i], ny = py+ney[i];
        if(valid(nx,ny)){
            if(a[nx][ny] == 'o'){
                ll nex = now+1;
                dfs(nx,ny,nex);
            }
            if(a[nx][ny] == 'x'){
                ll nex = now-1;
                if(nex >= 0) dfs(nx,ny,nex);
            }
        }
    }
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> H >> W;
    a=VS(H);
    for(ll i = 0; i < H; i++) cin >> a[i];

    VVVL dp(H,VVL(W,VL(100)));
    dp[0][0][1]=1;
/*
    queue<PLL> q;
    VVL vis(H,VL(W));    
    q.push({0,0});
    while(q.size()){
        PLL p = q.front();
        q.pop();
        ll px = p.first, py = p.second;
        if(vis[px][py]) continue;
        ll nx,ny;
        for(ll i = 0; i < 2; i++){
            nx = px+nex[i], ny = py+ney[i];
            if(valid(nx,ny) && !vis[nx][ny]){
                if(a[nx][ny] == 'o'){
                    for(ll j = 0; j <= 30; j++){
                        dp[nx][ny][j+1] += dp[px][py][j];
                    }
                }
                if(a[nx][ny] == 'x'){
                    for(ll j = 1; j <= 30; j++){
                        dp[nx][ny][j-1] += dp[px][py][j];
                    }
                }
                q.push({nx,ny});
            }   
        }

    }
*/
/*
    for(ll bit = 0; bit < 1LL<<(H+W); bit++){
        ll px = 0, py = 0, now = 0;
        for(ll i = 0; i < H+W; i++){
            if(bit & (1<<i)){
                py++;
            }
            else{
                px++;
            }

            if(!valid(px,py)){
                now = -1;
                break;
            }

        }
    }
    */
    dfs(0,0,1);
    cout << ans << endl;
    
    
}