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

public class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int h = Integer.parseInt(sc.next());
        int w = Integer.parseInt(sc.next());
        byte a[][] = new byte[h][w];
        for(int i = 0; i < h; i++){
        	String s = sc.next();
        	byte sb[] = s.getBytes();
        	for (int j = 0; j < w; j++){
        		a[i][j] = sb[j];
        	}
        }

        int depth[][] = new int[h][w];
        Deque<Integer> q = new ArrayDeque<Integer>();
        for(int i = 0; i < h; i++){
        	for(int j = 0; j < w; j++){
                if (a[i][j] == (byte)('#') ){
                	depth[i][j] = 0;
                	q.addLast(i * 1000 + j);
                }
        	}
        }
        while(! q.isEmpty()){
        	Integer r = q.removeFirst();
        	int i = r / 1000;
        	int j = r % 1000;
        	if (i > 0 && a[i-1][j] == (byte)('.') && depth[i-1][j] == 0){
        		depth[i-1][j] = depth[i][j] + 1;
        		q.addLast(i * 1000 - 1000 + j);
        	}
        	if (i < h-1 && a[i+1][j] == (byte)('.') && depth[i+1][j] == 0){
        		depth[i+1][j] = depth[i][j] + 1;
        		q.addLast(i * 1000 + 1000 + j);
        	}
        	if (j > 0 && a[i][j-1] == (byte)('.') && depth[i][j-1] == 0){
        		depth[i][j-1] = depth[i][j] + 1;
        		q.addLast(i * 1000 + j - 1);
        	}
        	if (j < w-1 && a[i][j+1] == (byte)('.') && depth[i][j+1] == 0){
        		depth[i][j+1] = depth[i][j] + 1;
        		q.addLast(i * 1000 + j + 1);
        	}
        }
        int ret = 0;
        for(int i = 0; i < h; i++){
        	for(int j = 0; j < w; j++){
        		if (ret < depth[i][j]) ret = depth[i][j];
        	}
    	}
        System.out.println(ret);
	}
}
