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
import java.util.*;
import java.lang.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int h = sc.nextInt();
		int w = sc.nextInt();
		String[] a = new String[h];
		for (int i = 0; i < h; i++) {
			a[i] = sc.next();
		}
		int[][] kyori = new int[h][w];
		Queue<Integer> queue = new ArrayDeque<>();
		boolean[][] visited = new boolean[h][w];
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (a[i].charAt(j) == '#') {
					visited[i][j] = true;
					queue.add(i * 10000 + j);
				}
			}
		}
		while (!queue.isEmpty()) {
			int tmp = queue.remove();
			int r = tmp / 10000;
			int c = tmp % 10000;
			int count = kyori[r][c];
			if (r > 0 && !visited[r - 1][c]) {
				kyori[r - 1][c] = count + 1;
				visited[r - 1][c] = true;
				queue.add(((r - 1) * 10000 + c));
			}
			if (r < h - 1 && !visited[r + 1][c]) {
				kyori[r + 1][c] = count + 1;
				visited[r + 1][c] = true;
				queue.add((r + 1) * 10000 + c);
			}
			if (c > 0 && !visited[r][c - 1]) {
				kyori[r][c - 1] = count + 1;
				visited[r][c - 1] = true;
				queue.add(r * 10000 + c - 1);
			}
			if (c < w - 1 && !visited[r][c + 1]) {
				kyori[r][c + 1] = count + 1;
				visited[r][c + 1] = true;
				queue.add(r * 10000 + c + 1);
			}
		}
		int max = 0;
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				max = Math.max(max, kyori[i][j]);
			}
		}
		System.out.println(max);
	}
}