#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i=0; i<int(n); i++)
using namespace std;

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int H, W; cin >> H >> W;
    vector<string> X(H);
    rep(y,H) cin >> X[y];
    vector<vector<vector<int>>> dp(H, vector<vector<int>>(W, vector<int>(H+W)));
    dp[0][0][1] = 1;
    rep(i,H) rep(j,W) rep(k,H+W) if(dp[i][j][k]){
        if(i != H-1 && X[i+1][j] != '#'){
            int nx = k + (X[i+1][j] == 'o' ? 1 : -1);
            if(0 <= nx) dp[i+1][j][nx] += dp[i][j][k];
        }
        if(j != W-1 && X[i][j+1] != '#'){
            int nx = k + (X[i][j+1] == 'o' ? 1 : -1);
            if(0 <= nx) dp[i][j+1][nx] += dp[i][j][k];
        }
    }
    int ans = 0;
    rep(i,H+W) ans += dp[H-1][W-1][i];
    cout << ans << '\n';
    return 0;
}