#include<bits/stdc++.h>
using namespace std;
int n,m,s;
char a[505][505];
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
int b[505][505];
int jx,jy;
void dfs(int x,int y,int step){
	b[x][y]=step;
	a[x][y]='#';
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]!='#'&&step+1<b[tx][ty]){
			dfs(tx,ty,step+1);
		}
	}
}
int main(){
    cin>>n>>m>>s;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    	    cin>>a[i][j];
    	    b[i][j]=INT_MAX;
        }
    }
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    	    if(a[i][j]=='S'){
    	    	dfs(i,j,0);
    	    }
    	    if(a[i][j]=='E'){
    	    	jx=i;
    	    	jy=j;
    	    }
        }
    }
    if(b[jx][jy]==INT_MAX) cout<<-1;return 0;
    cout<<-1;
	return 0;
}
/**************************************************************
	Problem: 2109
	User: zengdongxin
	Language: C++
	Result: Wrong Answer
****************************************************************/