#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
using namespace atcoder;
using namespace std;

#define rep(i,n) for (int i = 0; i < n; i++)
using ll = long long;
set<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
const int inf =1e9;
const ll infl = 4e18;
template <typename T>
bool chmax(T &a, const T& b) {if (a < b) {a = b;  return true;}return false;}
template <typename T>
bool chmin(T &a, const T& b) {if (a > b) {a = b;  return true;}return false;}


int main(){
    int H,W; cin >> H >>W;
    vector<string> A(H);
    rep(i,H) cin >> A[i];
    vector<vector<vector<ll>>> dp(H,vector<vector<ll>>(W,vector<ll>(21,0)));
    dp[0][0][1]=1;
    rep(i,H) rep(j,W){
        if(A[i][j]=='#') continue;
        rep(k,20){
            if(i>0){
                if (A[i][j]=='o'){
                    dp[i][j][k+1]+=dp[i-1][j][k];
                }
                else{
                    dp[i][j][k]+=dp[i-1][j][k+1];
                }
            }
            if(j>0){
                if (A[i][j]=='o'){
                    dp[i][j][k+1]+=dp[i][j-1][k];
                }
                else{
                    dp[i][j][k]+=dp[i][j-1][k+1];
                }
            }
        }
    }
    ll ans=0;
    rep(i,21) ans+=dp[H-1][W-1][i];
    cout << ans << endl;
}