#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using pii = pair<int, int>;

#define fi       first
#define se       second
#define All(x)   x.begin(), x.end()
#define debug(x) cout << #x << " = " << (x) << '\n';

const int iINF = 1'000'000'000;
const ll INF   = 1'000'000'000'000'000'000;

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

const int dx2[] = {0,  0, 1, -1};
const int dy2[] = {1, -1, 0,  0};

int N, M, sr, sc, er, ec;
int dist[maxN][maxN];
char grid[maxN][maxN];
bool vis[maxN][maxN];

void bfsDist() {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            dist[i][j] = iINF;
        }
    }

    queue<pair<pii, int>> Q;
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            if (grid[i][j] == '*') {
                Q.push({{i, j}, 0});
                dist[i][j] = 0;
            }
        }
    }

    while (!Q.empty()) {
        auto [pos, cdist] = Q.front();
        auto [r, c] = pos;
        Q.pop();
        if (vis[r][c]) continue;

        vis[r][c] = true;
        for (int i = 0; i < 8; i++) {
            int nr = r + dx[i], nc = c + dy[i];
            if (nr < 1 || nr > N || nc < 1 || nc > M) continue;

            if (dist[nr][nc] > cdist + 1) {
                dist[nr][nc] = cdist + 1;
                Q.push({{nr, nc}, cdist + 1});
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            if (grid[i][j] == '#') {
                dist[i][j] = 0;
            }
        }
    }
}

bool check(int x) {
    if (dist[sr][sc] < x) return false;

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            vis[i][j] = false;
        }
    }

    queue<pii> Q;
    Q.push({sr, sc});

    while (!Q.empty()) {
        auto [r, c] = Q.front();
        Q.pop();
        if (vis[r][c]) continue;

        vis[r][c] = true;
        for (int i = 0; i < 4; i++) {
            int nr = r + dx2[i], nc = c + dy2[i];
            if (nr < 1 || nr > N || nc < 1 || nc > M) continue;

            if (dist[nr][nc] >= x) {
                Q.push({nr, nc});
            }
        }
    }

    return vis[er][ec];
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> N >> M;
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            cin >> grid[i][j];
            if (grid[i][j] == 'S') {
                sr = i; sc = j;
            }
            if (grid[i][j] == 'E') {
                er = i; ec = j;
            }
        }
    }

    bfsDist();
    // for (int i = 1; i <= N; i++) {
    //     for (int j = 1; j <= M; j++) {
    //         cout << dist[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }

    int B = max(N, M);
    int L = 1, R = B + 1, ans = -1;
    while (L <= R) {
        int mid = (L + R) >> 1;
        if (check(mid)) {
            ans = mid;
            L = mid + 1;
        } else {
            R = mid - 1;
        }
    }

    if (ans == B + 1) {
        cout << "safe\n";
    } else {
        cout << ans << '\n';
    }
}