#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
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;
}

int main(){
    ll h,w;cin >> h >> w;
    vector<string> g(h);rep(i,h)cin >> g[i];
    ll dp[10][10][20];
    memset(dp,0,sizeof(dp));
    dp[0][0][1]=1;
    rep(i,h){
        rep(j,w){
            rep(k,20){
                if(i+1<h){
                    if(g[i+1][j]=='#'){}
                    else if(g[i+1][j]=='o'){
                        if(k+1<20)dp[i+1][j][k+1]+=dp[i][j][k];
                    }
                    else{
                        if(k-1>=0)dp[i+1][j][k-1]+=dp[i][j][k];
                    }
                }
                if(j+1<w){
                    if(g[i][j+1]=='#'){}
                    else if(g[i][j+1]=='o'){
                        if(k+1<20)dp[i][j+1][k+1]+=dp[i][j][k];
                    }
                    else{
                        if(k-1>=0)dp[i][j+1][k-1]+=dp[i][j][k];
                    }
                }
            }
        }
    }
    ll ans=0;
    rep(k,20)ans+=dp[h-1][w-1][k];
    cout << ans << endl;
}