#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define rep(i, n) for(i = 0; i < n; ++i)
#define inc_rep(i, a, n) for(i = a; i <= n; ++i)
#define dec_rep(i, n, a) for(i = n; i >= a; --i)
#define in(a) cin >> a
#define out(a, b) cout << a << b
#define print_vec(v)                              \
    for(auto it = v.begin(); it != v.end(); ++it) \
        cout << *it << " ";                       \
    cout << endl
#define print_vec2d(v)                       \
    for(int i = 0; i < v.size(); ++i) {      \
        for(int j = 0; j < v[i].size(); ++j) \
            cout << v[i][j] << " ";          \
        cout << endl;                        \
    }                                        \
    cout << endl
#define print_vecpair(v)              \
    for(int i = 0; i < v.size(); ++i) \
    cout << v[i].first << " " << v[i].second << endl
#define vin(v)                        \
    for(int i = 0; i < v.size(); ++i) \
    cin >> v[i]
#define v2din(v)                             \
    for(int i = 0; i < v.size(); ++i) {      \
        for(int j = 0; j < v[i].size(); ++j) \
            cin >> v[i][j];                  \
    }
#define vpairin(v)                      \
    for(int i = 0; i < v.size(); ++i) { \
        int a, b;                       \
        cin >> a >> b;                  \
        v[i] = make_pair(a, b);         \
    }
using namespace std;
using lint = long long;
using ull = unsigned long long;

int cnt = 0;
int h, w;
vector<string> vs;

void dfs(int i, int j, int jwl) {
    if(vs[i][j] == 'o') { jwl++; }
    else if(vs[i][j] == 'x') {
        jwl--;
        if(jwl < 0) { return; }
    }

    if(i == h - 1 && j == w - 1 && jwl >= 0) {
        cnt++;
        return;
    }

    for(auto [di, dj] : vector<pair<int, int>>{{1, 0}, {0, 1}}) {
        int ni = i + di, nj = j + dj;
        if(ni < h && nj < w && vs[ni][nj] != '#') {
            dfs(ni, nj, jwl);
        }
    }
    return;
}

int main(void) {
    cin >> h >> w;
    vs.resize(h);
    vin(vs);

    dfs(0, 0, 0);

    cout << cnt << "\n";

    return 0;
}