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.*;
import java.awt.Point;
 
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int H = sc.nextInt();
		int W = sc.nextInt();
		int K = sc.nextInt();
		String[] map = new String[H];
		boolean[][] used = new boolean[H][W];
		int dist = Integer.MAX_VALUE;
		ArrayDeque<Point> deq = new ArrayDeque<Point>();
		for(int i=0; i<H; i++){
			map[i] = sc.next();
			for(int j=0; j<W; j++){
				if(map[i].charAt(j)=='S'){
					deq.add(new Point(i,j));
					used[i][j] = true;
					dist = distance(H,W,i,j);
				}
			}
		}
		
		Point[] dir = { new Point(1,0), new Point(-1,0), new Point(0,1), new Point(0,-1) };
		
		for(int i=0; i<K; i++){
			int size = deq.size();
			for(int j=0; j<size; j++){
				Point p = deq.poll();
				for(int k=0; k<4; k++){
					int newX = p.x + dir[k].x;
					int newY = p.y + dir[k].y;
					
					if(in_field(H,W,newX,newY)&&map[newX].charAt(newY)=='.'&&!used[newX][newY]){
						deq.add(new Point(newX,newY));
						used[newX][newY] = true;
						dist = Math.min(dist, distance(H,W,newX,newY));
					}
				}
			}
		}
		
		if(dist==0){
			System.out.println(1);
		}else{
			int ans = (int)Math.ceil((double)dist/(double)K) + 1;
			System.out.println(ans);
		}
		return;
	}
	
	public static boolean in_field(int h, int w, int x, int y){
		return (0 <= x && x < h)&&(0 <= y && y < w);
	}
	
	public static int distance(int h, int w, int x, int y){
		return Math.min(Math.min(x, h-x-1), Math.min(y, w-y-1));
	}
}