/* be name khoda */

// #define stream_enable
// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;

#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

stringstream sss;

// -----------------------------------------------------------------------

const ll maxn = 110;

ll H, W, Ex, Ey;
ll grid[maxn][maxn];
ll psx[maxn][maxn], psy[maxn][maxn];
ll dp[maxn][maxn];

void MAIN() {

    cin >> H >> W;
    fori (i, H) {
        fori (j, W) {
            char c; cin >> c;
            if (c == 'E') Ex = i, Ey = j;
            else if (c == 'o') grid[i][j] = 1;
        }
    }
    if (Ex > H - 1 - Ex) {
        Ex = H - 1 - Ex;
        fori (i, H / 2) fori (j, W) swap(grid[i][j], grid[H - 1 - i][j]);
    }
    if (Ey > W - 1 - Ey) {
        Ey = W - 1 - Ey;
        fori (i, H) fori (j, W / 2) swap(grid[i][j], grid[i][W - 1 - j]);
    }
    fori (i, H) {
        fori (j, W) {
            psx[i][j + 1] = psx[i][j] + grid[i][j];
            psy[j][i + 1] = psy[j][i] + grid[i][j];
        }
    }
    ll ans = 0;
    fori (x, Ex + 1) {
        fori (y, Ey + 1) {
            memset(dp, 0, sizeof dp);
            forirto (i, H - Ex + x, x) {
                forirto (j, W - Ey + y, y) {
                    dp[i][j] = max(dp[i + 1][j] + psx[i][min(W - Ey + y, Ey + j + 1)] - psx[i][j],
                                   dp[i][j + 1] + psy[j][min(H - Ex + x, Ex + i + 1)] - psy[j][i]);
                }
            }
            smax(ans, dp[x][y]);
        }
    }
    cout << ans << '\n';

}

// -----------------------------------------------------------------------

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(10);
    sss << R"(
3 3
o.o
.Eo
ooo


5 11
ooo.ooo.ooo
o.o.o...o..
ooo.oE..o..
o.o.o.o.o..
o.o.ooo.ooo
    )";
    MAIN();
    return 0;
}


Measured memory_bytes: 512