#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, m;
bool M[1002][1002], yy[1002][1002];
vpii vd, vx;
pii search(int x, int y){
  int r1 = 0, r2 = 0, _x, _y;
  queue<pii> qd, qx;
  pii t;
  yy[x][y] = true;
  qd.push(mp(x, y));
  while(!qd.empty()){
    t = qd.front();
    qd.pop();
    each(itr, vd){
      _x = itr->fi + t.fi;
      _y = itr->se + t.se;
      if(0 <= _x && _x <= n+1 && 0 <= _y && _y <= m+1 && !yy[_x][_y]){
        if(M[_x][_y]){
          qx.push(mp(_x,_y));
        }else{
          yy[_x][_y] = true;
          qd.push(mp(_x,_y));
        }
      }
    }
  }
  while(!qx.empty()){
    t = qx.front();
    qx.pop();
    if(yy[t.fi][t.se])continue;
    queue<pii> qqx;
    qqx.push(t);
    yy[t.fi][t.se] = true;
    pii pos = mp(0, 0);
    int c = 0;
    while(!qqx.empty()){
      c++;
      pii tt = qqx.front();
      qqx.pop();
      each(itr, vx){
        _x = itr->fi + tt.fi, _y = itr->se + tt.se;
        if(0 <= _x && _x <= n+1 && 0 <= _y && _y <= m+1 && !yy[_x][_y]){
          if(M[_x][_y]){
            yy[_x][_y] = true;
            qqx.push(mp(_x,_y));
          }else{
            pos = mp(_x,_y);
          }
        }
      }
    }
    pos = search(pos.fi, pos.se);
    r1 += max(c + pos.se, pos.fi);
    r2 += max(pos.fi, pos.se);
  }
  return mp(r1, r2);
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n){
    string s;
    cin >> s;
    FOR(j, 0, m)M[i+1][j+1] = (s[j] == 'x');
  }
  vd.pb(mp( 1, 0));
  vd.pb(mp(-1, 0));
  vd.pb(mp( 0, 1));
  vd.pb(mp( 0,-1));

  vx.pb(mp( 1, 0));
  vx.pb(mp(-1, 0));
  vx.pb(mp( 0, 1));
  vx.pb(mp( 0,-1));
  vx.pb(mp( 1, 1));
  vx.pb(mp(-1, 1));
  vx.pb(mp( 1,-1));
  vx.pb(mp(-1,-1));
  pii ans = search(0, 0);
  cout << max(ans.fi, ans.se) << endl;
  return 0;
}