#include<iostream>
#include<climits>
#include<cstdio>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)
typedef long long ll;
const int N = 500;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
const ll inf = 1LL<<60;
char m[N][N+1];
ll dcost[N][N];//¼ÚS[ÜÅs­RXg
ll scost[N][N];//olðgÁ½ÌRXg
void bfs(int r,int c,char s,ll cost[N][N]){
  queue<int> Q;
  rep(i,r)rep(j,c)
    if (m[i][j] == s)cost[i][j] = 0,Q.push(i*c+j);
    else cost[i][j] = inf;
  while(!Q.empty()){
    int y = Q.front()/c,x=Q.front()%c;Q.pop();
    rep(i,4){
      int ney = y+dy[i],nex = x+dx[i];
      if (m[ney][nex] == '*' || m[ney][nex] == 'g' || m[ney][nex] == '#' || cost[ney][nex] != inf)continue;
      cost[ney][nex] = cost[y][x] + 1;
      Q.push(ney*c+nex);
    }
  }
}

/*
  e}X©çÌúÒlÍA
  min(¼ÚS[ÜÅs­AÅZÌolÜÅJ¢Ä¢ÁÄòÔ{úÒl)
  ±±ÅÌúÒlÍ (òñ¾ Æs­Â\«ª é}XÌúÒlÌa)/(»Ìæ¤È}XÌ)B
  
  KÉúÒlðßÅ¿µÄAÇ¤µ·é©ðl¦ÄÝéB
  úÒlð³çÉ¬³­Å«éÈç¬³­µÄAå«­È¢Æ¢¯È¢Èçå«­·éB
 */
double exp[N][N];
double bf(int r,int c){
  double e=0;//úÒlÌaðÁÄ¨­ÆðÉ§Â
  double pos = 0;//olÅs­Â\«Ì éêÌ
  int sy,sx;
  rep(i,r){
    rep(j,c){
      if (m[i][j] == '*' || m[i][j] == 'g' || m[i][j] == '#')continue;
      exp[i][j] = dcost[i][j];
      e += dcost[i][j];
      pos++;
      if (m[i][j] == 's')sy = i,sx = j;
    }
  }

  /*
    olÅòñÅ©çS[ÜÅ½Çè­ÜÅÌúÒlðßÅ¿·éB
    »ÌúÒlð³ÉÀÛÌúÒlðvZµÄÝÄA¬³¯êÎßÅ¿µ½úÒlæèàÁÆ¬³­Å«éB
    å«¯êÎàÁÆå«­È¢Æ¢¯È­ÈéB
   */
  double L = 0,R=1e20;
  double ans = -1;
  rep(i,300){
    double mid = (L+R)/2.;
    double newe = 0;
    rep(i,r){
      rep(j,c){
	if (m[i][j] == 'g' || m[i][j] == '#' || m[i][j] == '*')continue;
	double tmp = dcost[i][j];
	double tmp2 = scost[i][j] + mid/pos;
	newe += min(tmp,tmp2);
      }
    }
    if (newe < mid){//\zæè¬³©Á½
      ans = mid;
      R = mid - 1e-10;
    }else {//\zæèå«©Á½
      L = mid + 1e-10;
    }
  }
  return  min((double)dcost[sy][sx],scost[sy][sx]+ans/pos);

  /*
    û©·éÜÅñµÄÝ½
   */
  /*
  while(true){
    bool isupdate = false;
    double newe = 0;
    rep(i,r){
      rep(j,c){
	if (m[i][j] == 'g' || m[i][j] == '#')continue;//±±Íl¦È¢B
	double tmp = dcost[i][j];
	double tmp2 = scost[i][j] + (e)/(pos);
	if (exp[i][j] > min(tmp,tmp2)){
	  isupdate = true;
	  e -= exp[i][j];
	  exp[i][j] = min(tmp,tmp2);
	  e += exp[i][j];
	}
	newe += exp[i][j];
      }
    }
    e = newe;
    if (!isupdate)break;
  }

  /*
  ðúÌè@ª³µ­®­©`FbN·é½ßÉ¢½
  *
  double hoge = 0;
  rep(i,r){
    rep(j,c){
      if (m[i][j] == '#' || m[i][j] == 'g' || m[i][j] == '*')continue;
      hoge += min((double)dcost[i][j],scost[i][j] + e/pos);
      cout << min((double)dcost[i][j],scost[i][j] + e/pos) <<" " ;
    }
    cout << endl;
  }
  cout <<"hoge " << e <<" " << hoge/pos << endl;
  */
  //rep(i,r)rep(j,c)if (m[i][j] == 's')return exp[i][j];
}

main(){
  int r,c;
  while(cin>>c>>r && r){
    rep(i,r)cin>>m[i];
    bfs(r,c,'*',scost);
    bfs(r,c,'g',dcost);
    printf("%.12lf\n",bf(r,c));
  }
}

Measured memory_bytes: 7076