#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 0
#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int MOD = 1000000007;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

int main() {
	int H, W;
	cin >> H >> W;
	vector<string> grid(H);
	rep(i, H) {
		cin >> grid[i];
	}

	vector<vector<vector<int>>> dp(H, vector<vector<int>>(W, vector<int>(105, 0)));
	dp[0][0][1] = 1;
	set<vector<int>> s;
	s.insert({ 0,0,0 });
	while (!s.empty()) {
		vector<int> v = *begin(s);
		vector<int> now = { v[1], v[2] };

		s.erase(v);
		if (grid[now[0]][now[1]] == '#') {
			continue;
		}
		if (now[0] < H - 1 && grid[now[0] + 1][now[1]] == 'o') {
			rep(i, 101) {
				dp[now[0] + 1][now[1]][i + 1] += dp[now[0]][now[1]][i];
			}
			s.insert({ now[0] + now[1] + 1, now[0] + 1, now[1] });
		}
		else if (now[0] < H - 1 && grid[now[0] + 1][now[1]] == 'x') {
			for (int i = 1; i <= 100; i++) {
				dp[now[0] + 1][now[1]][i - 1] += dp[now[0]][now[1]][i];
			}
			s.insert({ now[0] + now[1] + 1, now[0] + 1, now[1] });
		}

		if (now[1] < W - 1 && grid[now[0]][now[1]+1] == 'o') {
			rep(i, 101) {
				dp[now[0]][now[1]+1][i + 1] += dp[now[0]][now[1]][i];
			}
			s.insert({ now[0] + now[1] + 1, now[0], now[1]+1 });
		}
		else if (now[1] < W - 1 && grid[now[0]][now[1]+1] == 'x') {
			for (int i = 1; i <= 100; i++) {
				dp[now[0]][now[1]+1][i - 1] += dp[now[0]][now[1]][i];
			}
			s.insert({ now[0] + now[1] + 1, now[0], now[1]+1 });
		}
	}

	int ans = 0;
	rep(i, 101) {
		ans += dp[H - 1][W - 1][i];
	}
	cout << ans << endl;
}