#include<bits/stdc++.h>
using namespace std;
char a[502][502];
int n,m,c,sx,sy,ex,ey; 
struct noi{
	int x;
	int y;
	int t;
};
queue<noi> yu;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
	cin>>n>>m>>c;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			if(a[i][j]=='S') sx=i,sy=j;
			if(a[i][j]=='E') ex=i,ey=j;
		}
	}
	yu.push({sx,sy,0}); 
	a[sx][sy]='#';
	while(!yu.empty()){
		int x=yu.front().x;
		int y=yu.front().y;
		int t=yu.front().t+1;
		for(int i=0;i<=3;i++){
			int tx=x+dx[i];
			int ty=y+dy[i];
			if(x>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]!='#'){
				a[tx][ty]='#';
				yu.push({tx,ty,t});
				if(tx==ex&&ty==ey){
					cout<<t*c;
					return 0;
				}
			}
		}
		yu.pop();
	}
	cout<<-1;
	return 0;
}

/**************************************************************
	Problem: 2109
	User: huangsheng
	Language: C++
	Result: Accepted
	Time:24 ms
	Memory:2324 kb
****************************************************************/