// {{{ by shik
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }

template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
    int c=0;
    while ( *s!=',' || c!=0 ) {
        if ( *s=='(' || *s=='[' || *s=='{' ) c++;
        if ( *s==')' || *s==']' || *s=='}' ) c--;
        cerr<<*s++;
    }
    cerr<<"="<<head<<", ";
    _dump(s+1,tail...);
}

#define dump(...) do { \
    fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
    _dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)

template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}

template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif

template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }

void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
    _R(head);
    R(tail...);
}

template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
    for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
        if ( i!=x.cbegin() ) putchar(' ');
        _W(*i);
    }
}

void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
    _W(head);
    putchar(sizeof...(tail)?' ':'\n');
    W(tail...);
}

#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
    freopen(name ".in","r",stdin); \
    freopen(name ".out","w",stdout); \
} while (0)
#endif

// }}}

const int N=110;

struct P {
    int x1,y1,x2,y2,v;
};

bool operator ==( const P &a, const P &b ) {
    return tie(a.x1,a.y1,a.x2,a.y2)==tie(b.x1,b.y1,b.x2,b.y2);
}

bool operator <( const P &a, const P &b ) {
    return tie(a.x1,a.y1,a.x2,a.y2,a.v)<tie(b.x1,b.y1,b.x2,b.y2,b.v);
}

int n,m,ss[N][N];
char s[N][N];

inline int get( int x1, int y1, int x2, int y2 ) {
    return ss[x2][y2]-ss[x1-1][y2]-ss[x2][y1-1]+ss[x1-1][y1-1];
}

int main() {
    R(n,m);
    REP1(i,1,n) REP1(j,1,m) R(s[i][j]);
    REP1(i,1,n) REP1(j,1,m) ss[i][j]=ss[i-1][j]+ss[i][j-1]-ss[i-1][j-1]+(s[i][j]=='o');
    int ex=-1,ey=-1;
    REP1(i,1,n) REP1(j,1,m) if ( s[i][j]=='E' ) tie(ex,ey)=tie(i,j);
    assert(ex!=-1);
    vector<P> v,nv;
    v.PB(P{ex,ey,ex,ey,0});
    int ans=0;
    while ( !v.empty() ) {
        nv.clear();
        sort(ALL(v));
        REP(i,SZ(v)) {
            if ( i+1<SZ(v) && v[i]==v[i+1] ) continue;
            auto &p=v[i];
            ans=max(ans,p.v);
            int x1,y1,x2,y2;
            tie(x1,y1,x2,y2)=tie(p.x1,p.y1,p.x2,p.y2);
            int xx1=x2-ex+1;
            int yy1=y2-ey+1;
            int xx2=x1+(n-ex);
            int yy2=y1+(m-ey);
            int xxx1=max(x1,xx1);
            int yyy1=max(y1,yy1);
            int xxx2=min(x2,xx2);
            int yyy2=min(y2,yy2);
            dump(x1,y1,x2,y2,xx1,yy1,xx2,yy2,p.v);
            if ( x1-1>=xx1 ) nv.PB(P{x1-1,y1,x2,y2,p.v+get(x1-1,yyy1,x1-1,yyy2)});
            if ( y1-1>=yy1 ) nv.PB(P{x1,y1-1,x2,y2,p.v+get(xxx1,y1-1,xxx2,y1-1)});
            if ( x2+1<=xx2 ) nv.PB(P{x1,y1,x2+1,y2,p.v+get(x2+1,yyy1,x2+1,yyy2)});
            if ( y2+1<=yy2 ) nv.PB(P{x1,y1,x2,y2+1,p.v+get(xxx1,y2+1,xxx2,y2+1)});
        }
        v.swap(nv);
    }
    W(ans);
    return 0;
}


Measured memory_bytes: 8116