#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, ans, c[50][50], v[5] = {0, 1, 0, -1, 0}, wb[2], id[4] = {1, 3, 2, 4};
string s[50];
set<pii> y[5];
pii t;
set<pii>::iterator itr;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n)cin >> s[i];
  FOR(i, 0, n)FOR(j, 0, m){
    if(s[i][j] == '.') continue;
    int a = 0;
    FOR(k, 0, 4){
      int h = i + v[k], w = j + v[k+1];
      if(0 <= h && h < n && 0 <= w && w < m && s[h][w] != '.') a++;
    }
    y[a].insert(mp(i, j));
    c[i][j] = a;
  }
  bool z;
  int h, _h, __h, w, _w, __w;
  while(true){
    z = true;
    if(!y[0].empty()){
      itr = y[0].begin();
      wb[(itr->fi + itr->se)%2]++;
      s[itr->fi][itr->se] = '.';
      c[itr->fi][itr->se] = -1;
      y[0].erase(itr);
      continue;
    }
    FOR(i, 0, 4){
      if(!y[id[i]].empty()){
        z = false;
        itr = y[id[i]].begin();
        h = itr->fi, w = itr->se;
        FOR(j, 0, 4){
          _h = h + v[j], _w = w + v[j+1];
          if(0 <= _h && _h < n && 0 <= _w && _w < m && s[_h][_w] != '.'){
            FOR(k, 0, 4){
              __h = _h + v[k], __w = _w + v[k+1];
              if(0 <= __h && __h < n && 0 <= __w && __w < m && s[__h][__w] != '.'){
                y[c[__h][__w]].erase(mp(__h, __w));
                c[__h][__w]--;
                y[c[__h][__w]].insert(mp(__h, __w));
              }
              __h = h + v[k], __w = w + v[k+1];
              if(0 <= __h && __h < n && 0 <= __w && __w < m && s[__h][__w] != '.'){
                y[c[__h][__w]].erase(mp(__h, __w));
                c[__h][__w]--;
                y[c[__h][__w]].insert(mp(__h, __w));
              }
            }
            ans += 100;
            s[h][w] = '.';
            y[c[h][w]].erase(mp(h, w));
            c[h][w] = -1;
            s[_h][_w] = '.';
            y[c[_h][_w]].erase(mp(_h, _w));
            c[_h][_w] = -1;
            break;
          }
        }
        break;
      }
    }
    if(z) break;
  }
  sort(wb, wb+2);
  cout << ans + wb[0] * 9 + wb[1] << endl;
  return 0;
}