#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 500 + 5,  mod = 998244353;


int n, m, dis[N][N], id, vis[N][N], vis2[N][N];


int fromR, fromC, toR, toC;

vector<pair<int, int> > src;

char a[N][N];

int dr[] = {0, 0, 1, -1};
int dc[] = {1, -1, 0, 0};


bool valid(int r, int c) {
    return r >= 0 && r < n && c >= 0 && c < m;
}

void bfs() {
    queue<pair< pair<int, int>, pair<int, int> > > q;
    for(auto i: src) {
        q.push({i, {0, 0}});
        dis[i.first][i.second] = 0;
    }

    while((int) q.size() > 0) {
        int r = q.front().first.first, c = q.front().first.second;
        int kamR = q.front().second.first, kamC = q.front().second.second;
        q.pop();
        for(int i = 0; i < 4; i++) {
            int nr = r + dr[i], nc = c + dc[i];
            int nkamR = kamR + dr[i], nkamC = kamC + dc[i];
            if(valid(nr, nc) && dis[nr][nc] > max(abs(nkamR), abs(nkamC))) {
                dis[nr][nc] = max(abs(nkamR), abs(nkamC));
                q.push({{nr, nc}, {nkamR, nkamC}});
            }
        }
    }
}

void dfs(int r, int c) {
    vis[r][c] = 1;

    for(int i = 0; i < 4; i++) {
        int nr = r + dr[i], nc = c + dc[i];
        if(valid(nr, nc) && a[nr][nc] != '#' && a[nr][nc] != '*' && vis[nr][nc] == 0) {
            dfs(nr, nc);
        }
    }
}

void dfs2(int r, int c, int d) {
    if(dis[r][c] < d) {
        return;
    }
    vis2[r][c] = id;

    for(int i = 0; i < 4; i++) {
        int nr = r + dr[i], nc = c + dc[i];
        if(valid(nr, nc) && a[nr][nc] != '#' && vis2[nr][nc] != id) {
            dfs2(nr, nc, d);
        }
    }

}



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

    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> a[i][j];
            dis[i][j] = mod;
            if(a[i][j] == 'S') {
                fromR = i;
                fromC = j;
            }
            else if(a[i][j] == 'E') {
                toR = i;
                toC = j;
            }
            else if(a[i][j] == '*') {
                src.push_back({i, j});
            }
        }
    }

    bfs();

//    for(int i = 0; i < n; i++) {
//        for(int j = 0; j < m; j++) {
//            cout << dis[i][j] << ' ';
//        }
//        cout << '\n';
//    }

    dfs(fromR, fromC);


    if(vis[toR][toC] == 0) {
        cout << -1;
        return 0;
    }

    if((int) src.size() == 0) {
        cout << "safe";
        return 0;
    }

    int low = 1, high = 1200, ans = 1500;
    while(high >= low) {
        id++;
        int mid = low + high >> 1;
        dfs2(fromR, fromC, mid);
        if(vis2[toR][toC] == id) {
            ans = mid;
            low = mid + 1;
        }
        else high = mid - 1;
    }
    cout << ans << '\n';




    return 0;
}