#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace::std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define endl "\n"
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/numeric/interval.hpp>
#include <boost/numeric/interval/io.hpp>
#include <boost/any.hpp>
using namespace::std;
namespace mp = boost::multiprecision;
typedef mp::number<mp::cpp_dec_float<32,int64_t>> cfloat;
typedef mp::cpp_int cint;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"");if(i>INF/2)cout<<"INF";else cout<<i;f=1;}cout<<"\n";}while(0)
#define output2(v) for(auto j:v)output(j);
#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF 9223372036854775807
#define MOD 1000000007
inline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}
inline lint lcm(lint a,lint b){return a*b/gcd(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
inline lint mex(vector<lint> s){
    lint res=0;
    sort(all(s));
    while(binary_search(all(s),res))res++;
    return res;
}
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};
int main(){
    lint h,w,k;
    cin>>h>>w>>k;
    mat v(h,vec(w,0));
    mat diff(h,vec(w,INF));
    mat delv(h,vec(w,-1));
    lint sh=0,sw=0;
    rep(i,h){
        string s;
        cin>>s;
        rep(j,w){
            if(s[j]=='#')v[i][j]=1;
            if(s[j]=='S')sh=i,sw=j;
        }
    }
    priority_queue<tuple<lint,lint,lint,lint>,vector<tuple<lint,lint,lint,lint>>,greater<tuple<lint,lint,lint,lint>>> que;
    que.emplace(0,0,sh,sw);
    while(!que.empty()){
        lint now,del,r,c;
        tie(now,del,r,c)=que.top();
        que.pop();
        rep(i,4){
            if(r+dy[i]<0||h<=r+dy[i]||c+dx[i]<0||w<=c+dx[i]){
                cout<<(now-1)/k+1;
                return 0;
            }
            lint next,nextDel=del;
            if(del==0&&v[r+dy[i]][c+dx[i]]==1){
                next=now/k*k+k+1;
                nextDel=k-1;
            }else{
                next=now+1;
                if(v[r+dy[i]][c+dx[i]]==1)nextDel--;
                if(next%k==0)nextDel+=k;
            }
            bool f=chmin(diff[r+dy[i]][c+dx[i]],next);
            bool f2=chmax(delv[r+dy[i]][c+dx[i]],nextDel);
            if(f||f2){
                que.emplace(next,nextDel,r+dy[i],c+dx[i]);
            }
        }
    }
}