#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(...) __VA_ARGS__;
#else
#define debug(...) 24;
#endif

template<class A, class B>
ostream& operator<<(ostream &os, pair<A, B> &p);
template<class T>
ostream& operator<<(ostream &os, vector<T> &v);
template<class T, size_t sz>
ostream& operator<<(ostream &os, array<T, sz> &v);

template<class A, class B>
ostream& operator<<(ostream &os, pair<A, B> &p) {
  return os << '(' << p.first << ',' << p.second << ')';
}

template<class T>
ostream& operator<<(ostream &os, vector<T> &v) {
  os << '{';
  bool f = 0; for(auto &i : v) { if(f) os << ',';os << i; f = 1;}
  return os << '}';
}

template<class T, size_t sz>
ostream& operator<<(ostream &os, array<T, sz> &v) {
  os << '{';
  bool f = 0; for(auto &i : v) { if(f) os << ',';os << i; f = 1;}
  return os << '}';
}

using pii = pair<int, int>;
#define fi first
#define se second

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

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int n, m; cin >> n >> m;
  vector a(n, vector<char>(m));
  for(auto &v : a) for(auto &c : v) cin >> c;

  vector<pii> free;
  vector<pii> p;
  pii s, e;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++) {
      if(a[i][j] == 'S') {
        s = {i, j};
      }
      if(a[i][j] == 'E') {
        e = {i, j};
      }
      if(a[i][j] == '*') {
        p.emplace_back(i, j);
        a[i][j] = '#';
      }
      if(a[i][j] != '#')
        free.emplace_back(i, j);
    }
  }

  if(p.empty()) { // bfs
    vector vis(n, vector<int>(m, 0));
    queue<pii> q;
    q.push({s.fi, s.se});
    vis[s.fi][s.se] = 1;
    while(!q.empty()) {
      auto [i, j] = q.front(); q.pop();
      for(int x = 0; x < 4; x++) {
        int ni = i+dx[x], nj = j+dy[x];
        if(ni < 0 || nj < 0 || ni >= n || nj >= m) continue;
        if(a[ni][nj] == '#') continue;
        if(!vis[ni][nj]) {
          vis[ni][nj] = 1;
          q.push({ni, nj});
        }
      }
    }
    if(vis[e.fi][e.se]) cout << "safe" << '\n';
    else cout << -1 << '\n';
    return 0;
  }

  vector val(n, vector<int>(m, -1));
  queue<pii> q;
  for(auto &[i, j] : p) {
    val[i][j] = 0;
    q.push({i, j});
  }
  while(!q.empty()) {
    auto [i, j] = q.front(); q.pop();
    for(int x = 0; x < 8; x++) {
      int ni = i+dx[x], nj = j+dy[x];
      if(ni < 0 || nj < 0 || ni >= n || nj >= m) continue;
      if(val[ni][nj] == -1) {
        val[ni][nj] = val[i][j] + 1;
        q.push({ni, nj});
      }
    }
  }
  
  sort(all(free), [&](pii i, pii j){
    return val[i.fi][i.se] > val[j.fi][j.se];
  });

  const auto toidx = [&](pii x) {
    return x.fi*m + x.se;
  };
  vector<int> par(n*m, -1);
  function<int(int)> find = [&](int x) {
    return x == par[x] ? x : (par[x] = find(par[x]));
  };
  function<bool(int, int)> join = [&](int x, int y) {
    if(find(x) == find(y)) return false;
    debug(cerr << " join " << x << ' ' << y << '\n');
    par[find(x)] = find(y);
    return true;
  };
  int idxs = toidx(s), idxe = toidx(e);

  for(pii nw : free) {
    debug(cerr << nw << '\n');
    int idx = toidx(nw);
    par[idx] = idx;
    for(int i = 0; i < 4; i++) {
      pii to;
      to.fi = nw.fi + dx[i];
      to.se = nw.se + dy[i];
      if(to.fi < 0 || to.fi >= n || to.se < 0 || to.se >= m) continue;
      if(par[toidx(to)] == -1) continue;
      join(idx, toidx(to));
    }
    if(par[idxs] != -1 && par[idxe] != -1 && find(idxs) == find(idxe)) {
      cout << val[nw.fi][nw.se] << '\n';
      return 0;
    }
  }
  cout << -1 << '\n';
}