Problem: One morning when you woke up, it was in a springy labyrinth.

I don't know why I'm in such a strange place. You have the option of waiting for help here, but you know from experience that if you stay in a labyrinth like this for a long time, a gust of wind will surely blow you away. It was. However, the time until the gust blows cannot be judged. So you thought it was best to act to minimize the expected number of moves required to escape the labyrinth.

When I picked up an unidentified scroll that had fallen under my feet and read it as a trial, I happened to be able to perceive the entire map of the labyrinth. Furthermore, by drinking the grass that I happened to have, I was able to know the positions of all the traps. Apparently, there are no traps other than dangerous monsters and springs in this labyrinth.

This labyrinth is shaped like a rectangle with several types of tiles, for example:



.. ## g. #
* #. * #. #
...... #
* s # *. * #



".":floor. You can walk around freely on this.

"#":wall. You can't get inside the wall.

"S": Your first position. Below this tile is the floor.

"G": Stairs. If you ride on this tile, you have escaped from the labyrinth.

"*":Spring. If you ride on this tile, it will be randomly blown onto one of the floors (excluding stairs and spring tiles). The odds of being hit on each floor are all equal.

The type of tile is one of these five.

You can move one square at a time from the tile you are currently riding to an adjacent tile in either the up, down, left, or right direction. However, you cannot move to Naname.

Given a map of the labyrinth, find the expected number of moves required to escape the labyrinth if you take the best strategy. It is not included in the number of movements that is blown by the spring.



Input

W H
c11 c12 ... c1w
c21 c22 ... c2w
:::
ch1 ch2 ... ccw


On the first line of input, the integer W (3 ≤ W ≤ 500) and the integer H (3 ≤ H ≤ 500) are written in this order, separated by blanks. The integer W represents the width of the labyrinth, and the integer H represents the height of the labyrinth.

The following H line contains W letters (not blank delimiters) that represent the map of the labyrinth. The format of this part is as in the example given above. Note that "s" and "g" appear exactly once in the data. In addition, one square around the labyrinth is always surrounded by a wall.

In addition, in the given labyrinth, no matter how you move and how it is blown by the spring, you will fall into a state where you cannot escape even if you can arbitrarily set the floor to be blown by the spring. You can assume that there is no such thing.

Output

Output the expected number of moves to escape when you take the best strategy. The output may contain errors, but the relative error to the true value must be less than 10-9.

Examples

Input

8 6
########
#..##g.#
#*#.*#.#
#......#
#*s#*.*#
########


Output

5.857142857143


Input

8 6

..##g.#
*#.*#.#
......#
*s#*.*#


Output

5.857142857143


Input

21 11

*#*.*.*.*.*.*.*.*#*#
*#...............#*#
*#.#.#.#.#.#.#.#.#*#
.#.#.#.#.#.#.#.#.##
...................#
.#.#.#.#.#.#.#.#.##
s#.#.#.#.#.#.#.#.#g#
...................#
...................#


Output

20.000000000000


Input

9 8

...#*.*#
.*.#...#
...#*.*#

.s....g#
.*#.*..#


Output

5.000000000000

Solution (in JAVA):

Solution:
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		new Main().solver();
	}

	int[] dx = { 1, -1, 0, 0 };
	int[] dy = { 0, 0, 1, -1 };
	char[][] table;
	long INF = 1L << 50;

	int h, w;

	void solver() {
		Scanner sc = new Scanner(System.in);
		w = sc.nextInt();
		h = sc.nextInt();
		int sx = -1, sy = -1, gx = -1, gy = -1;
		double n = 0;
		table = new char[h][w];
		long[][] distance_from_goal = new long[h][w];
		long[][] distance_from_spring = new long[h][w];

		ArrayDeque<Pair> que1 = new ArrayDeque<>();
		ArrayDeque<Pair> que2 = new ArrayDeque<>();

		for (int i = 0; i < h; i++) {
			table[i] = sc.next().toCharArray();
			Arrays.fill(distance_from_goal[i], INF);
			Arrays.fill(distance_from_spring[i], INF);

			for (int j = 0; j < w; j++) {
				if (table[i][j] == 's') {
					sx = j;
					sy = i;
					n++;
				} else if (table[i][j] == 'g') {
					gx = j;
					gy = i;
					distance_from_goal[gy][gx] = 0;
				} else if (table[i][j] == '.')
					n++;
				else if (table[i][j] == '*') {
					distance_from_spring[i][j] = 0;
					que2.add(new Pair(j, i));
				}
			}
		}

		que1.add(new Pair(gx, gy));
		while (!que1.isEmpty()) {
			Pair p = que1.poll();
			for (int i = 0; i < 4; i++) {
				int nx = p.x + dx[i];
				int ny = p.y + dy[i];
				if (on_filed(nx, ny) && distance_from_goal[ny][nx] > distance_from_goal[p.y][p.x] + 1) {
					distance_from_goal[ny][nx] = distance_from_goal[p.y][p.x] + 1;
					if (table[ny][nx] == '.' || table[ny][nx] == 's')
						que1.add(new Pair(nx, ny));
				}
			}
		}

		while (!que2.isEmpty()) {
			Pair p = que2.poll();
			for (int i = 0; i < 4; i++) {
				int nx = p.x + dx[i];
				int ny = p.y + dy[i];
				if (on_filed(nx, ny) && distance_from_spring[ny][nx] > distance_from_spring[p.y][p.x] + 1) {
					distance_from_spring[ny][nx] = distance_from_spring[p.y][p.x] + 1;
					if (table[ny][nx] == '.' || table[ny][nx] == 's')
						que2.add(new Pair(nx, ny));
				}
			}
		}

		double a = 0, b = 0;
		ArrayList<P> list = new ArrayList<>();
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '.' || table[i][j] == 's') {
					if (distance_from_goal[i][j] >= INF) {
						a += distance_from_spring[i][j];
						b++;
						continue;
					} else {
						a += distance_from_goal[i][j];
						if (distance_from_spring[i][j] >= (1 << 30)
								|| distance_from_goal[i][j] <= distance_from_spring[i][j]) {
							continue;
						} else
							list.add(new P(distance_from_goal[i][j], distance_from_spring[i][j]));
					}
				}
			}
		}
		list.sort(null);

		// E=a+bE
		double e = a / (n - b);
		for (int i = 0; i < list.size(); i++) {
			a -= list.get(i).d_goal;
			a += list.get(i).d_spring;
			b++;
			if (i + 1 < list.size() && list.get(i).diff == list.get(i + 1).diff)
				continue;

			e = Math.min(e, (a / (n - b)));
		}

		System.out.println(Math.min(distance_from_goal[sy][sx], e + distance_from_spring[sy][sx]));
	}

	boolean on_filed(int x, int y) {
		if (0 <= x && x < w && 0 <= y && y < h && table[y][x] != '#')
			return true;
		else
			return false;
	}

	class Pair {
		int x;
		int y;

		public Pair(int x, int y) {
			this.x = x;
			this.y = y;
		}
	}

	class P implements Comparable<P> {
		long d_goal;
		long d_spring;
		long diff;

		public P(long d_goal, long d_spring) {
			this.d_goal = d_goal;
			this.d_spring = d_spring;
			diff = d_goal - d_spring;
		}

		@Override
		public int compareTo(P o) {
			return -Long.compare(this.diff, o.diff);
		}
	}

	void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}
}