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.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int h=sc.nextInt();
        int w=sc.nextInt();
        String[] input=new String[h];
        boolean[][] inp=new boolean[h][w];
        Queue<Integer>y=new ArrayDeque<>();
        Queue<Integer>x=new ArrayDeque<>();
        for(int i=0;i<h;i++){
            input[i]=sc.next();
            for(int j=0;j<w;j++){
                inp[i][j]=input[i].charAt(j)=='#';
                if(inp[i][j]){
                    y.add(i);
                    x.add(j);
                }
            }
        }
        int[][] far=new int[h][w];
        int visited=x.size();
        int ans=0;
        int[] numsx={1,0,-1,0};
        int[] numsy={0,1,0,-1};
        int sizetmp;
        while(true){
            if(visited==h*w){
                System.out.println(ans);
                return;
            }
            ans++;
            sizetmp=x.size();
            for(int i=0;i<sizetmp;i++){
                for(int j=0;j<4;j++){
                    try{
                        if(!inp[y.peek()+numsy[j]][x.peek()+numsx[j]]){
                            far[y.peek()+numsy[j]][x.peek()+numsx[j]]=ans;
                            inp[y.peek()+numsy[j]][x.peek()+numsx[j]]=true;
                            visited++;
                            y.add(y.peek()+numsy[j]);
                            x.add(x.peek()+numsx[j]);
                        }
                    }catch(Exception e){
                        continue;
                    }
                }
                x.remove();
                y.remove();
            }
        }
        
        
    }

}