#include<bits/stdc++.h>
using namespace std;
int n,m,s,dx,dy,gx,gy;
char a[501][501];
int c[501][501];
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
void dfs(int x,int y,int k){
    c[x][y]=k;
    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]!='#'&&k+1<c[tx][ty]){
            dfs(tx,ty,k+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];
            if(a[i][j]=='S'){
                dx=i;
                dy=j;
            }
            if(a[i][j]=='E'){
                gx=i;
                gy=j;
            }
            c[i][j]=INT_MAX;
        }
    }
    c[dx][dy]=0;
    dfs(dx,dy,0);
    if(c[gx][gy]==INT_MAX){
        cout<<-1;
        return 0;
    }
    cout<<c[gx][gy]*s;
}
/**************************************************************
	Problem: 2109
	User: zhengzihao
	Language: C++
	Result: Accepted
	Time:56 ms
	Memory:22552 kb
****************************************************************/