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 {
    int h;
    int w;
    char[][] map;
    boolean[][] visited;

    void run() {
        Scanner sc = new Scanner(System.in);

        h = sc.nextInt();
        w = sc.nextInt();

        map = new char[h][w];
        visited = new boolean[h][w];

        for (int i = 0; i < h; i++) {
            map[i] = sc.next().toCharArray();
        }

        List<Integer> blacks = new ArrayList<>();

        // 1000 * 1000
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                if (map[i][j] == '#') {
                    visited[i][j] = true;
                    blacks.add(toPoint(i, j));
                }
            }
        }

        int count = -1;
        while (true) {
            if (blacks.isEmpty()) break;
            count++;
            blacks = next(blacks);
        }

        // write your code
        System.out.println(count);
    }

    List<Integer> next(List<Integer> blacks) {
        List<Integer> newBlacks = new ArrayList<>();

        for (int bp : blacks) {
            int i = bp / 1000;
            int j = bp % 1000;

            if (bp % 1000 != 0 && !visited[i][j - 1]) {
                visited[i][j - 1] = true;
                newBlacks.add(bp - 1);
            }
            if (bp % 1000 != w - 1 && !visited[i][j + 1]) {
                visited[i][j + 1] = true;
                newBlacks.add(bp + 1);
            }
            if (bp / 1000 != 0 && !visited[i - 1][j]) {
                visited[i - 1][j] = true;
                newBlacks.add(bp - 1000);
            }
            if (bp / 1000 != h - 1 && !visited[i + 1][j]) {
                visited[i + 1][j] = true;
                newBlacks.add(bp + 1000);
            }
        }
        return newBlacks;
    }


    int toPoint(int i, int j) {
        return i * 1000 + j;
    }


    void debug(Object... os) {
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args) {
        new Main().run();
    }
}
