#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf  1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define  mp make_pair
#define  pb push_back
#define EPS (1e-10)

int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
    int x;
    int y,z;
    pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
    bool operator < (const pa3 &p) const{
        if(x!=p.x) return x<p.x;
        if(y!=p.y) return y<p.y;
        return z<p.z;
        //return x != p.x ? x<p.x: y<p.y;
    }
    bool operator > (const pa3 &p) const{
        if(x!=p.x) return x>p.x;
        if(y!=p.y) return y>p.y;
        return z>p.z;
        //return x != p.x ? x<p.x: y<p.y;
    }
    bool operator == (const pa3 &p) const{
        return x==p.x && y==p.y && z==p.z;
    }
    bool operator != (const pa3 &p) const{
        return !( x==p.x && y==p.y && z==p.z);
    }
    
};

class pa4{
public:
    int x;
    int y,z,w;
    pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
    bool operator < (const pa4 &p) const{
        if(x!=p.x) return x<p.x;
        if(y!=p.y) return y<p.y;
        if(z!=p.z)return z<p.z;
        return w<p.w;
        //return x != p.x ? x<p.x: y<p.y;
    }
    bool operator > (const pa4 &p) const{
        if(x!=p.x) return x>p.x;
        if(y!=p.y) return y>p.y;
        if(z!=p.z)return z>p.z;
        return w>p.w;
        //return x != p.x ? x<p.x: y<p.y;
    }
    bool operator == (const pa4 &p) const{
        return x==p.x && y==p.y && z==p.z &&w==p.w;
    }
    
    
};
class pa2{
public:
    int x,y;
    pa2(int x=0,int y=0):x(x),y(y) {}
    pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
    pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
    bool operator < (const pa2 &p) const{
        return y != p.y ? y<p.y: x<p.x;
    }
    bool operator > (const pa2 &p) const{
        return x != p.x ? x<p.x: y<p.y;
    }
    bool operator == (const pa2 &p) const{
        return abs(x-p.x)==0 && abs(y-p.y)==0;
    }
    bool operator != (const pa2 &p) const{
        return !(abs(x-p.x)==0 && abs(y-p.y)==0);
    }
    
    
};



string itos( int i ) {
    ostringstream s ;
    s << i ;
    return s.str() ;
}

int gcd(int v,int b){
    if(v>b) return gcd(b,v);
    if(v==b) return b;
    if(b%v==0) return v;
    return gcd(v,b%v);
}


int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {
    return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
    return {l.first-r.first,l.second-r.second};
}

int pr[1200010];
int inv[1200010];

int beki(int wa,int rr,int warukazu){
    if(rr==0) return 1%warukazu;
    if(rr==1) return wa%warukazu;
    wa%=warukazu;
    if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
    ll zx=beki(wa,rr/2,warukazu);
    return (zx*zx)%warukazu;
}


int comb(int nn,int rr){
    if(rr<0 || rr>nn || nn<0) return 0;
    int r=pr[nn]*inv[rr];
    r%=mod;
    r*=inv[nn-rr];
    r%=mod;
    return r;
}

void gya(int ert){
    pr[0]=1;
    for(int i=1;i<=ert;i++){
        pr[i]=(pr[i-1]*i)%mod;
    }
    inv[ert]=beki(pr[ert],mod-2,mod);
    for(int i=ert-1;i>=0;i--){
        inv[i]=inv[i+1]*(i+1)%mod;
    }
}

//   cin.tie(0);
//    ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//    mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;



//----------------kokomade tenpure------------
int a[110][110]={};
int rui[110][110]={};
int dp[110][110];

int r(int sx,int tx,int sy,int ty){
    return rui[tx][ty]+rui[sx][sy]-rui[sx][ty]-rui[tx][sy];
}
signed main(){
    
    
    cin.tie(0);
    ios::sync_with_stdio(false);
    int h,w;
    cin>>h>>w;
    int sx,sy;
    for(int i=1;i<=h;i++){
        
        string s;
        cin>>s;
        s="s"+s;
        for(int j=1;j<=w;j++){
            if(s[j]=='E'){
                sx=i,sy=j;
            }
            else if(s[j]=='o')a[i][j]=1;
        }
    }
    
    if(h-sx<sx-1){
        for(int i=1;h+1-i>i;i++){
            for(int j=1;j<=w;j++){
                
                swap(a[i][j],a[h+1-i][j]);
            }
            
        }
        sx=h+1-sx;
    }
    
    if(w-sy<sy-1){
        for(int j=1;w+1-j>j;j++){
            for(int i=1;i<=h;i++){
                
                swap(a[i][j],a[i][w+1-j]);
            }
        }
        sy=w+1-sy;
    }
    /*
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }
    */
    for(int i=1;i<=h;i++)for(int j=1;j<=w;j++){
        rui[i][j]=rui[i-1][j]+rui[i][j-1]+a[i][j]-rui[i-1][j-1];
    }
    int ans=0;
    for(int x=1;x<=sx;x++)for(int y=1;y<=sy;y++){
        int val=-1;
        for(int xx=x+sx-1;xx<=x+h-sx;xx++)for(int yy=y+sy-1;yy<=y+w-sy;yy++){
            if(xx==x+sx-1 && yy==y+sy-1){
                dp[xx][yy]=r(xx-sx,xx,yy-sy,yy);
                
            }
            else{
                dp[xx][yy]=0;
                if(xx>x+sx-1){
                    dp[xx][yy]=max(dp[xx][yy],dp[xx-1][yy]+r(xx-1,xx,yy-sy,yy));
                }
                if(yy>y+sy-1){
                    dp[xx][yy]=max(dp[xx][yy],dp[xx][yy-1]+r(xx-sx,xx,yy-1,yy));
                }
            }
            val=dp[xx][yy];
        }
        
        ans=max(ans,val);
      //  cout<<x<<" "<<y<<" "<<val<<endl;
    }
    cout<<ans<<endl;
    return 0;
    
}



Measured memory_bytes: 512