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.ArrayDeque;
import java.util.Queue;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) throws Exception{
		Scanner stdIn=new Scanner(System.in);
		Queue<Integer> black = new ArrayDeque<Integer>();
		int H=stdIn.nextInt();
		int W=stdIn.nextInt();
		char a[]=new char[H*W];
		String b="";
		boolean fin=false;
		int z=0,y=0,x=0,i=0,j=0;
		while(z<H*W){
			if(z%W==0){
				b=stdIn.next();y=0;
			}
			a[z]=b.charAt(y);
			if(a[z]=='#')
				black.add(z);
			z++;y++;
		}z=1;y=0;x=black.size();
		while(true){
			while(y<x){
				i=black.poll();
				if(i-W>=0)
					if(a[i-W]=='.'){
						black.add(i-W);
						a[i-W]='#';fin=true;
					}
				if(i+W<H*W)
					if(a[i+W]=='.'){
						black.add(i+W);
						a[i+W]='#';fin=true;
					}
				if(i-1>=0&&i%W!=0)
					if(a[i-1]=='.'){
						black.add(i-1);
						a[i-1]='#';fin=true;
					}
				if(i+1<H*W&&i%W!=W-1)
					if(a[i+1]=='.'){
						black.add(i+1);
						a[i+1]='#';fin=true;
					}
				y++;
			}j+=y;y=0;
			x=black.size();
			if(fin==false)
				z--;
			if(x+j==H*W)
				break;
			fin=false;
			z++;
		}
		System.out.println(z);
	}
}