#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int h, w;
	cin >> h >> w;
	vector<string> s(h);
	cin >> s;
	const int M = 25;
	vector<vector<vector<long long>>> dp(h, vector<vector<long long>>(w, vector<long long>(M)));
	dp[0][0][1] = 1;
	rep(y, h) rep(x, w) rep(z, M){
		if(y + 1 < h){
			if(s[y + 1][x] == 'o'){
				if(z + 1 < M) dp[y + 1][x][z + 1] += dp[y][x][z];
			}
			if(s[y + 1][x] == 'x'){
				if(z - 1 >= 0) dp[y + 1][x][z - 1] += dp[y][x][z];
			}
		}
		if(x + 1 < w){
			if(s[y][x + 1] == 'o'){
				if(z + 1 < M) dp[y][x + 1][z + 1] += dp[y][x][z];
			}
			if(s[y][x + 1] == 'x'){
				if(z - 1 >= 0) dp[y][x + 1][z - 1] += dp[y][x][z];
			}
		}
	}
	long long ans = 0;
	rep(i, M) ans += dp[h - 1][w - 1][i];
	cout << ans << "\n";
	return 0;
}