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
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	final int[] dx = new int[] { 1, -1, 0, 0 };
	final int[] dy = new int[] { 0, 0, 1, -1 };

	void run() {
		Scanner sc = new Scanner(System.in);
		int H = sc.nextInt();
		int W = sc.nextInt();
		int K = sc.nextInt();
		char[][] A = new char[H][W];
		for (int i = 0; i < H; ++i) {
			A[i] = sc.next().toCharArray();
		}
		int sh = -1, sw = -1;
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++j) {
				if (A[i][j] == 'S') {
					sh = i;
					sw = j;
				}
			}
		}

		int[][] d = new int[H][W];
		for (int i = 0; i < d.length; ++i) {
			for (int j = 0; j < d[i].length; ++j) {
				d[i][j] = Integer.MAX_VALUE / 16;
			}
		}
		d[sh][sw] = 0;
		class P {
			int h, w;

			public P(int h, int w) {
				this.h = h;
				this.w = w;
			}
		}

		ArrayDeque<P> que = new ArrayDeque<>();
		que.add(new P(sh, sw));
		while (!que.isEmpty()) {
			P p = que.poll();
			for (int i = 0; i < 4; ++i) {
				P np = new P(p.h + dy[i], p.w + dx[i]);
				if (!movable(np.h, np.w, A))
					continue;
				if (d[np.h][np.w] > d[p.h][p.w] + 1 && d[p.h][p.w] + 1 <= K) {
					d[np.h][np.w] = d[p.h][p.w] + 1;
					que.add(np);
				}
			}
		}

		int ans = Integer.MAX_VALUE / 16;
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++j) {
				if (d[i][j] > K)
					continue;
				ans = Math.min(ans, 1 + (f(i, j, H, W) + K - 1) / K);
			}
		}
		System.out.println(ans);
	}

	int f(int h, int w, int H, int W) {
		int ret = Integer.MAX_VALUE / 16;
		ret = Math.min(ret, h);
		ret = Math.min(ret, H - 1 - h);
		ret = Math.min(ret, w);
		ret = Math.min(ret, W - 1 - w);
		return ret;
	}

	boolean movable(int h, int w, char[][] map) {
		if (h < 0 || w < 0 || h >= map.length || w >= map[0].length) {
			return false;
		}
		if (map[h][w] == '#') {
			return false;
		}
		return true;
	}

	private static void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}
}
