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

public class Main {
    public static void main(String[] arg){
        Scanner sc=new Scanner(System.in);
        int H=sc.nextInt();
        int W=sc.nextInt();
        char[][] map=new char[H][W];
        int[][] result=new int[H][W];

        for(int i=0;i<H;i++){
            map[i]=sc.next().toCharArray();
            for(int j=0;j<W;j++){
                if(map[i][j]=='#'){
                    result[i][j]=0;
                }
                else{
                    result[i][j]=9999;
                }
            }
        }
        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                if(j!=0) {
                    if (result[i][j] > result[i][j - 1] + 1) {
                        result[i][j] = result[i][j - 1] + 1;
                    }
                }
                if(i!=0){
                    if(result[i][j]>result[i-1][j]+1){
                        result[i][j]=result[i-1][j]+1;
                    }
                }
            }
        }
        for(int i=H-1;i>=0;i--){
            for(int j=W-1;j>=0;j--){
                if(j!=W-1) {
                    if (result[i][j] > result[i][j + 1] + 1) {
                        result[i][j] = result[i][j + 1] + 1;
                    }
                }
                if(i!=H-1){
                    if(result[i][j]>result[i+1][j]+1){
                        result[i][j]=result[i+1][j]+1;
                    }
                }
            }
        }
        int result2=0;
        for(int i=0;i<H;i++) {
            for (int j = 0; j < W; j++) {
                if (result[i][j] > result2) {
                    result2=result[i][j];
                }
            }
        }

        System.out.println(result2);
    }
}
