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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int H = sc.nextInt();
		int W = sc.nextInt();
		Main main = new Main();
		List<Point> targetList = new ArrayList<Point>();
		char c[][] = new char[H][W];
		for (int i = 0; i < H; i++) {
			String s = sc.next();
			char temp[] = s.toCharArray();
			for (int j = 0; j < W; j++) {
				c[i][j] = temp[j];
				if (c[i][j] == '#') {
					Point p = main.new Point();
					p.x = i;
					p.y = j;
					targetList.add(p);
				}
			}
		}
		int count =0;
		while (targetList.size()>0) {
			List<Point> temp = new ArrayList<Point>();
			for (Point p :targetList) {
				if (p.y>0) {
					if (c[p.x][p.y-1]=='.') {
						c[p.x][p.y-1] = '#';
						Point t = main.new Point();
						t.x = p.x;
						t.y = p.y-1;
						temp.add(t);
					}
				}
				if (p.x>0) {
					if (c[p.x-1][p.y]=='.') {
						c[p.x-1][p.y] = '#';
						Point t = main.new Point();
						t.x = p.x-1;
						t.y = p.y;
						temp.add(t);
					}
				}
				if (p.x<H-1) {
					if (c[p.x+1][p.y]=='.') {
						c[p.x+1][p.y] = '#';
						Point t = main.new Point();
						t.x = p.x+1;
						t.y = p.y;
						temp.add(t);
					}
				}
				if (p.y<W-1) {
					if (c[p.x][p.y+1]=='.') {
						c[p.x][p.y+1] = '#';
						Point t = main.new Point();
						t.x = p.x;
						t.y = p.y+1;
						temp.add(t);
					}
				}
			}
			targetList = temp;
			if (temp.size()>0) {
				count++;
			}
		}
		System.out.println(count);
	}

	public class Point {
		int x;
		int y;
	}
}