#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int h,w; cin >> h >> w;
    vector<string> s(h);
    for (int i = 0; i < h; ++i) {
        cin >> s[i];
    }
    using P = pair<pair<int,int>,int>;
    map<P, ll> mp;
    mp[{{0,0}, 1}] = 1;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (i+1 < h and s[i+1][j] != '#') {
                for (int k = 0; k <= h+w; ++k) {
                    P u = {{i, j}, k};
                    if (mp.find(u) != mp.end()) {
                        if (s[i+1][j] == 'x' and k == 0) continue;
                        int nxt = k + (s[i+1][j] == 'o' ? 1 : -1);
                        mp[{{i+1, j}, nxt}] += mp[u];
                    }
                }
            }
            if (j+1 < w and s[i][j+1] != '#') {
                for (int k = 0; k <= h+w; ++k) {
                    P u = {{i, j}, k};
                    if (mp.find(u) != mp.end()) {
                        if (s[i][j+1] == 'x' and k == 0) continue;
                        int nxt = k + (s[i][j+1] == 'o' ? 1 : -1);
                        mp[{{i, j+1}, nxt}] += mp[u];
                    }
                }
            }
        }
    }
    ll res = 0;
    for (int i = 0; i <= h+w; ++i) {
        res += mp[{{h-1,w-1}, i}];
    }
    cout << res << endl;
}