#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false


int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll H,W;
    cin >> H >> W;
    vector<string> A(H);
    REP(i,H){
        cin >> A[i];
    }

    ll dp[12][12][24] = {};
    dp[0][0][1] = 1;
    REP(i,H){
        REP(j,W){
            REP(k,22){

                if(i!=H-1 && A[i+1][j]!='#'){
                    if(A[i+1][j]=='o'){
                        dp[i+1][j][k+1] += dp[i][j][k];
                    }else{
                        if(k!=0)dp[i+1][j][k-1] += dp[i][j][k];
                    }
                }
                if(j!=W-1 && A[i][j+1]!='#'){
                    if(A[i][j+1]=='o'){
                        dp[i][j+1][k+1] += dp[i][j][k];
                    }else{
                        if(k!=0)dp[i][j+1][k-1] += dp[i][j][k];
                    }
                }

            }
        }
    }

    // REP(k,10){
    //     REP(i,H){
    //         REP(j,W){
    //             cout << dp[i][j][k] << " ";
    //         }cout << endl;
    //     }cout << endl;
    // }cout << endl;

    ll Ans = 0;
    REP(k,22){
        Ans += dp[H-1][W-1][k];
    }

    cout << Ans << endl;
    
    return 0;
    
}