Takahashi is locked within a building.

This building consists of H×W rooms, arranged in H rows and W columns. We will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= `#`, the room is locked and cannot be entered; if A_{i,j}= `.`, the room is not locked and can be freely entered. Takahashi is currently at the room where A_{i,j}= `S`, which can also be freely entered.

Each room in the 1-st row, 1-st column, H-th row or W-th column, has an exit. Each of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).

Takahashi will use his magic to get out of the building. In one cast, he can do the following:

* Move to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.
* Then, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.



His objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.

It is guaranteed that Takahashi is initially at a room without an exit.

Constraints

* 3 ≤ H ≤ 800
* 3 ≤ W ≤ 800
* 1 ≤ K ≤ H×W
* Each A_{i,j} is `#` , `.` or `S`.
* There uniquely exists (i,j) such that A_{i,j}= `S`, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.

Input

Input is given from Standard Input in the following format:


H W K
A_{1,1}A_{1,2}...A_{1,W}
:
A_{H,1}A_{H,2}...A_{H,W}


Output

Print the minimum necessary number of casts.

Examples

Input

3 3 3
#.#
#S.
###


Output

1


Input

3 3 3
.#
S.


Output

1


Input

3 3 3

S#


Output

2


Input

7 7 2


...##
S###
.#.##
.###


Output

2
#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

#define F first
#define S second

const int MAXN = 800 + 10;

int n, m, k;
string s[MAXN];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int lv[MAXN][MAXN];
pii q[MAXN*MAXN];

bool fit(int x, int y){return 0 <= x && x < n && 0 <= y && y < m && s[x][y] != '#';}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++)	cin >> s[i];
	pii a;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (s[i][j] == 'S')
				a = {i, j};

	memset(lv, 63, sizeof(lv));
	int h = 0, t = 0;
	q[t++] = a; lv[a.F][a.S] = 0;
	while (t-h){
		auto v = q[h++];
		if (lv[v.F][v.S] > k){
			h--;
			break;
		}
		for (int w = 0; w < 4; w++){
			pii u(v.F+dx[w], v.S+dy[w]);
			if (fit(u.F, u.S) && lv[v.F][v.S] + 1 < lv[u.F][u.S]){
				lv[u.F][u.S] = lv[v.F][v.S] + 1;
				q[t++] = u;
			}
		}
	}

	int ans = 1e9;
	for (int i = 0; i < h; i++){
		auto v = q[i];
		ans = min(ans, 1+(v.F+k-1)/k);
		ans = min(ans, 1+(v.S+k-1)/k);
		ans = min(ans, 1+(n-1-v.F+k-1)/k);
		ans = min(ans, 1+(m-1-v.S+k-1)/k);
	}
	cout << ans << endl;
	return 0;
}
