#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

template<typename T>
void updMin(T& a, T b)
{
	a = min(a, b);
}

int n, m;
int is = -1, js = -1, it = -1, jt = -1;

bool dfs(int i, int j, const vector<string>& grid, vector<VI>& used)
{
	used[i][j] = true;
	if (i == it && j == jt)
		return true;
	FOR(k, 0, 4)
	{
		int ni = i + dx[k], nj = j + dy[k];
		if (0 <= ni && ni < n && 0 <= nj && nj < m && grid[ni][nj] == '.' && !used[ni][nj] && dfs(ni, nj, grid, used))
		{
			return true;
		}
	}
	return false;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	vector<string> s(n);
	for (string& row : s)
		cin >> row;
	FOR(i, 0, n)
		FOR(j, 0, m)
		{
			if (s[i][j] == 'S')
			{
				is = i;
				js = j;
				s[i][j] = '.';
			}
			else if (s[i][j] == 'E')
			{
				it = i;
				jt = j;
				s[i][j] = '.';
			}
		}
	assert(is != -1 && it != -1);
	const int D = max(n, m) + 7;
	// special for Yarema
	vector<VI> distInRow(n, VI(m, D)), dist(n, VI(m, D));
	FOR(i, 0, n)
	{
		FOR(j, 0, m)
		{
			if (s[i][j] == '*')
				distInRow[i][j] = 0;
		}
		FOR(j, 1, m)
			updMin(distInRow[i][j], distInRow[i][j - 1] + 1);
		RFOR(j, m - 1, 0)
			updMin(distInRow[i][j], distInRow[i][j + 1] + 1);
	}
	FOR(i, 0, n)
		FOR(j, 0, m)
			FOR(k, 0, n)
				updMin(dist[i][j], max(abs(k - i), distInRow[k][j]));
	vector<string> grid(n, string(m, '.'));
	int l = -1, r = D;
	while (r - l > 1)
	{
		int mid = (l + r) / 2;
		grid = s;
		FOR(i, 0, n)
			FOR(j, 0, m)
				if (dist[i][j] < mid)
					grid[i][j] = '#';
		vector<VI> used(n, VI(m));
		if (dfs(is, js, grid, used))
			l = mid;
		else
			r = mid;
	}
	if (r == D)
		cout << "safe\n";
	else
		cout << l << "\n";
	return 0;
}