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
#include<cstdio>
#include<cstring>
char s[1010][1010];
int qx[1001000],qy[1001000],d[1001000],l=0,r=0;
int X[4]={-1,0,0,1};
int Y[4]={0,-1,1,0};
int main()
{
  	int n,m;
  	scanf("%d%d",&n,&m);
  	for(int i=1;i<=n;++i)
      	scanf("%s",s[i]+1);
  	for(int i=1;i<=n;++i)
      	for(int j=1;j<=m;++j)
          	if(s[i][j]=='#')
            {
            	qx[++r]=i;
              	qy[r]=j;
              	d[r]=0;
            }
 	while(l<r)
    {
      	int x=qx[++l];
      	int y=qy[l];
      	for(int i=0;i<4;++i)
          	if(s[x+X[i]][y+Y[i]]=='.'&&x+X[i]>0&&x+X[i]<=n&&y+Y[i]>0&&y+Y[i]<=m)
            {
              	qx[++r]=x+X[i];
              	qy[r]=y+Y[i];
              	s[qx[r]][qy[r]]='#';
              	d[r]=d[l]+1;
            }
    }
  	printf("%d\n",d[r]);
  	return 0;
}