#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int H, W;
vector<vector<vector<vector<int>>>> dp;
vector<string> a[2];

vector<vector<int>> su[2];

void prepare()
{
    REP(d, 2)
    {
        int H = a[d].size();
        int W = a[d][0].size();
        ndarray(su[d], H, W + 1);
        REP(h, H) REP(w, W) su[d][h][w + 1] = su[d][h][w] + (a[d][h][w] == 'o');
    }
}

int query(int d, int h, int l, int r)
{
    if (r <= l) return 0;
    return su[d][h][r] - su[d][h][l];
}

int main()
{
    cin >> H >> W;
    a[0].resize(H);
    a[1].resize(W);
    cin >> a[0];
    REP(i, H) REP(j, W) a[1][j].push_back(a[0][i][j]);
    int E0 = -1, E1 = -1;
    REP(i, H) REP(j, W) if (a[0][i][j] == 'E') E0 = i, E1 = j;

    int H1 = E0, H2 = H - 1 - E0, W1 = E1, W2 = W - 1 - E1;
    ndarray(dp, H1 + 1, H2 + 1, W1 + 1, W2 + 1);

    int ans = 0;
    prepare();
    REP(h1, H1 + 1) REP(h2, H2 + 1) REP(w1, W1 + 1) REP(w2, W2 + 1)
    {
        if (h1 and h1 + h2 <= H1) Max(dp[h1][h2][w1][w2], dp[h1 - 1][h2][w1][w2] + query(0, E0 - h1, max(w2, E1 - w1), min(W - w1, E1 + w2 + 1)));
        if (h2 and h1 + h2 <= H2) Max(dp[h1][h2][w1][w2], dp[h1][h2 - 1][w1][w2] + query(0, E0 + h2, max(w2, E1 - w1), min(W - w1, E1 + w2 + 1)));
        if (w1 and w1 + w2 <= W1) Max(dp[h1][h2][w1][w2], dp[h1][h2][w1 - 1][w2] + query(1, E1 - w1, max(h2, E0 - h1), min(H - h1, E0 + h2 + 1)));
        if (w2 and w1 + w2 <= W2) Max(dp[h1][h2][w1][w2], dp[h1][h2][w1][w2 - 1] + query(1, E1 + w2, max(h2, E0 - h1), min(H - h1, E0 + h2 + 1)));
        Max(ans, dp[h1][h2][w1][w2]);
    }

    cout << ans << endl;
}


Measured memory_bytes: 31616