#include <iostream>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 1005;
int n, m;
char mat[maxn][maxn];

bool visited[maxn][maxn][3];
// visited[i][j][0] = gazenje so cekor 1
// visited[i][j][1] = gazenje so cekor 2
// visited[i][j][2] = gazenje so cekor 3

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

    int si, sj, 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);
    q.push(1);



    int di[] = {-1, 1, 0, 0};
    int dj[] = {0, 0, -1, 1};
    int di2[] = {-2, 2, 0, 0};
    int dj2[] = {0, 0, -2, 2};
    int di3[] = {-3, 3, 0, 0};
    int dj3[] = {0, 0, -3, 3};




    return 0;
}