Problem: You are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black. HW characters from A_{11} to A_{HW} represent the colors of the squares. A_{ij} is `#` if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is `.` if that square is white.

We will repeatedly perform the following operation until all the squares are black:

* Every white square that shares a side with a black square, becomes black.



Find the number of operations that will be performed. The initial grid has at least one black square.

Constraints

* 1 \leq H,W \leq 1000
* A_{ij} is `#` or `.`.
* The given grid has at least one black square.

Input

Input is given from Standard Input in the following format:


H W
A_{11}A_{12}...A_{1W}
:
A_{H1}A_{H2}...A_{HW}


Output

Print the number of operations that will be performed.

Examples

Input

3 3
...
.#.
...


Output

2


Input

6 6
..#..#
......
..#..
......
.#....
....#.


Output

3

Solution (in JAVA):

Solution:
import java.lang.reflect.Array;
import java.util.*;
public class Main {
	static Queue<Integer> queue_x = new ArrayDeque<>();
	static Queue<Integer> queue_y = new ArrayDeque<>();
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int H = Integer.parseInt(sc.next());
		int W = Integer.parseInt(sc.next());
		int cnt[][] = new int[H][W];
		for(int i = 0; i < H; i++) {
			Arrays.fill(cnt[i], -1);
			String temp = sc.next();
			for(int j = 0; j < W; j++) {
				if(temp.substring(j, j + 1).equals("#")) {
					queue_x.add(j);
					queue_y.add(i);
					cnt[i][j] = 0;
				}
			}
		}
		
		int ans = 0;
		while(queue_x.size() != 0 && queue_y.size() != 0) {
			int y = queue_y.poll();
			int x = queue_x.poll();
			
			int dx[] = {0, 1, 0, -1};
			int dy[] = {1, 0, -1, 0};
			
			in : for(int i = 0; i < 4; i++) {
				if(x + dx[i] < 0) continue in;
				if(x + dx[i] >= W) continue in;
				if(y + dy[i] < 0) continue in;
				if(y + dy[i] >= H) continue in;
				
				if(cnt[y + dy[i]][x + dx[i]] == -1) {
					queue_x.add(x + dx[i]);
					queue_y.add(y + dy[i]);
					cnt[y + dy[i]][x + dx[i]] = cnt[y][x] + 1;
					ans = Math.max(ans, cnt[y + dy[i]][x + dx[i]]);
				}
			}
		}
		System.out.println(ans);
	}
}