#include <bits/stdc++.h>

using namespace std;

#define x	first
#define y	second

const int N = 100 + 5;
typedef pair<int, int> PII;
char g[N][N];
int d[N][N];
int dx[4] = {-1,0,1,0}, dy[4] = {0,-1,0,1};
int h, m;

int bfs(int sx, int sy)
{
	queue<PII> q;
	d[sx][sy] = 0;
	q.push({sx, sy});
	
	while(q.size())
	{
		auto t = q.front();
		q.pop();
		
		if(g[t.x][t.y] == 'E')
		{
			return d[t.x][t.y];
		}
		
		for(int i = 0; i < 4; i++)
		{
			int x = t.x + dx[i], y = t.y + dy[i];
			if((g[x][y] == '*' || g[x][y] == 'E') && d[x][y] == -1)
			{
				d[x][y] = d[t.x][t.y] + 1;
				q.push({x, y});
			}
		}
	}
	return -1;
}

int main()
{

	while(cin >> h >> m)
	{
	    int sx = 0, sy = 0;
		if(h == 0 && m == 0) break;
		memset(d, -1, sizeof d);
		memset(g, 0, sizeof g);
		for(int i = 0; i < h; i++)
		{
			cin >> g[i];
			for(int j = 0; j < m; j++)
				if(g[i][j] == 'S') sx = ...