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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int n,m;
    cin >> n >> m;
    vector<vector<char>>a(n+1,vector<char>(m+1));
    int sx,sy;
    int ex,ey;
    for(int i = 1; i<=n; i++){
        string s;
        cin >> s;
        for(int j = 1; j<=m; j++){
            a[i][j] = s[j-1];
            if(a[i][j] == 'S'){
                sx = i; sy = j;
            }
            if(a[i][j] == 'E'){
                ex = i; ey = j;
            }
        }
    }
    vector<int>dx = {-1,0,1,0,-1,-1,1,1};
    vector<int>dy = {0,1,0,-1,1,-1,1,-1};
    vector<vector<int>>dis2(n+1,vector<int>(m+1,(int)1e9));
    vector<vector<bool>>vis2(n+1,vector<bool>(m+1));
    queue<pii>q;
    for(int i = 1; i<=n; i++){
        for(int j = 1; j<=m; j++){
            if(a[i][j] == '*'){
                vis2[i][j] = true;
                dis2[i][j] = 0;
                q.push({i,j});
            }
        }
    }
    auto good = [&](int x, int y) -> bool {
        return x >= 1 && x <= n && y >= 1 && y <= m;
    };
    while(q.size()){
        auto [i,j] = q.front(); q.pop();
        for(int d = 0; d<8; d++){
            int x = dx[d] + i;
            int y = dy[d] + j;
            if(good(x,y) && !vis2[x][y]){
                vis2[x][y] = true;
                dis2[x][y] = dis2[i][j] + 1;
                q.push({x,y});
            }
        }
    }
    int low = -1; int high = (int)1e9;
    vector<vector<bool>>vis(n+1,vector<bool>(m+1));
    while(low + 1 < high){
        int mid = (low+high)/2;
        for(int i = 1; i<=n; i++){
            for(int j = 1; j<=m; j++){
                vis[i][j] = 0;
            }
        }
        vis[sx][sy] = true;
        q.push({sx,sy});
        while(q.size()){
            auto [i,j] = q.front(); q.pop();
            for(int d = 0; d<4; d++){
                int x = dx[d] + i;
                int y = dy[d] + j;
                if(good(x,y) && !vis[x][y] && dis2[x][y] >= mid && a[x][y] != '#' && a[x][y] != '*'){
                    vis[x][y] = true;
                    q.push({x,y});
                }
            }
        }
        if(vis[ex][ey]){
            low = mid;
        }
        else{
            high = mid;
        }
    }
    if(low == -1){
        cout << "-1\n";
        return 0;
    }
    if(low >100000){
        cout << "safe\n";
        return 0;
    }
    cout << low << '\n';
    return 0;
}