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();
        boolean[] field = new boolean[h * w];
        ArrayDeque<Integer> deq = new ArrayDeque<>();
        for (int i = 0; i < h; i++) {
            char[] arr = sc.next().toCharArray();
            for (int j = 0; j < w; j++) {
                if (arr[j] == '#') {
                    field[i * w + j] = true;
                    deq.add(i * w + j);
                }
            }
        }
        ArrayDeque<Integer> next = new ArrayDeque<>();
        int count = 0;
        while (deq.size() > 0) {
            count++;
            while (deq.size() > 0) {
                int x = deq.poll();
                if (x - w >= 0) {
                    if (!field[x - w]) {
                        next.add(x - w);
                        field[x - w] = true;
                    }
                }
                if (x + w < h * w) {
                    if (!field[x + w]) {
                        next.add(x + w);
                        field[x + w] = true;
                    }
                }
                if (x % w > 0) {
                    if (!field[x - 1]) {
                        next.add(x - 1);
                        field[x - 1] = true;
                    }
                }
                if (x % w < w - 1) {
                    if (!field[x + 1]) {
                        next.add(x + 1);
                        field[x + 1] = true;
                    }
                }
            }
            ArrayDeque<Integer> tmp = next;
            next = deq;
            deq = tmp;
        }
        System.out.println(count - 1);
   }
}