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 {
    static int h;
    static int w;
    static int dp[][];
    static Scanner sc;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        h = sc.nextInt();
        w = sc.nextInt();
        sc.nextLine();
        dp = new int[h][w];
        ArrayDeque<Point> p = new ArrayDeque<>();
        for (int i = 0; i < h; i++) {
            String tmp = sc.nextLine();
            for (int j = 0; j < w; j++) {
                char s = tmp.charAt(j);
                if(s == '#') {
                    dp[i][j] = 0;
                    p.add(new Point(i, j));
                }
                else {
                    dp[i][j] = -1;
                }
            }
        }
        while(!p.isEmpty()) {
            Point n = p.poll();
            if(n.x != 0) {
                if(dp[n.x-1][n.y] == -1) {
                    p.add(new Point(n.x-1, n.y));
                    dp[n.x-1][n.y] = dp[n.x][n.y] + 1;
                }
            }
            if(n.x < h-1) {
                if(dp[n.x+1][n.y] == -1) {
                    p.add(new Point(n.x+1, n.y));
                    dp[n.x+1][n.y] = dp[n.x][n.y] + 1;
                }
            }
            if(n.y != 0) {
                if(dp[n.x][n.y-1] == -1) {
                    p.add(new Point(n.x, n.y-1));
                    dp[n.x][n.y-1] = dp[n.x][n.y] + 1;
                }
            }
            if(n.y < w-1) {
                if(dp[n.x][n.y+1] == -1) {
                    p.add(new Point(n.x, n.y+1));
                    dp[n.x][n.y+1] = dp[n.x][n.y] + 1;
                }
            }
        }
        int ans = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                ans = Math.max(ans, dp[i][j]);
            }
        }
        System.out.println(ans);

    }
    static class Point {
        int x;
        int y;

        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Point point = (Point) o;
            return x == point.x &&
                    y == point.y;
        }

        @Override
        public int hashCode() {
            return Objects.hash(x, y);
        }
    }
}

