#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    char mat[n][m];

    int si, sj;
    int ei, ej;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];

            if(mat[i][j] == 'S') {
                si = i;
                sj = j;
            }
            if(mat[i][j] == 'E') {
                ei = i;
                ej = j;
            }
        }
    }

    queue<int> q;
    q.push(si);
    q.push(sj);
    q.push(0);

    vector<vector<bool>> visited(n, vector<bool>(m, false));
    visited[si][sj] = true;
    while(!q.empty()) {
        int ci = q.front();
        q.pop();

        int cj = q.front();
        q.pop();

        int distance = q.front();
        q.pop();

        if(ci == ei and cj == ej) {
            cout << "Najkratok pat iznesuva: " << distance << endl;
            break;
        }
        cout << "{ci: " << ci << " " << ", cj: " << cj << ", " << distance << "}" << endl;
        if(ci + 1 < n and mat[ci + 1][cj] != '#' and !visited[ci + 1][cj]) {
            q.push(ci + 1);
            q.push(cj);
            q.push(distance + 1);
            visited[ci + 1][cj] = true;
        }
        if(ci - 1 >= 0 and mat[ci - 1][cj] != '#' and !visited[ci - 1][cj]) {
            q.push(ci - 1);
            q.push(cj);
            q.push(distance + 1);
            visited[ci - 1][cj] = true;
        }
        if(cj + 1 < m and mat[ci][cj + 1] != '#' and !visited[ci][cj + 1]) {
            q.push(ci);
            q.push(cj + 1);
            q.push(distance + 1);
            visited[ci][cj + 1] = true;
        }
        if(cj - 1 >= 0 and mat[ci][cj - 1] != '#' and !visited[ci][cj - 1]) {
            q.push(ci);
            q.push(cj - 1);
            q.push(distance + 1);
            visited[ci][cj - 1] = true;
        }

    }


    return 0;
}

/*
4 3
S..
.#.
.#.
E..
 **/