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.*;
import java.io.*;

public class Main {
	public static void main (String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] first = br.readLine().split(" ", 2);
		int h = Integer.parseInt(first[0]);
		int w = Integer.parseInt(first[1]);
		boolean[][] field = new boolean[h][w];
		ArrayDeque<Integer> deq = new ArrayDeque<>();
		for (int i = 0; i < h; i++) {
		    char[] arr = br.readLine().toCharArray();
		    for (int j = 0; j < w; j++) {
		        field[i][j] = (arr[j] == '#');
		        if (field[i][j]) {
		            deq.add(i * w + j);
		        }
		    }
		}
		ArrayDeque<Integer> next = new ArrayDeque<>();
		int count = 0;
		while (deq.size() > 0) {
		    count++;
		    while(deq.size() > 0) {
		        int i = deq.poll();
		        int y = i / w;
		        int x = i % w;
		        if (y > 0 && !field[y - 1][x]) {
		            next.add((y - 1) * w + x);
		            field[y - 1][x] = true;
		        }
		        if (y < h - 1 && !field[y + 1][x]) {
		            next.add((y + 1) * w + x);
		            field[y + 1][x] = true;
		        }
		        if (x > 0 && !field[y][x - 1]) {
		            next.add(y * w + x - 1);
		            field[y][x - 1] = true;
		        }
		        if (x < w - 1 && !field[y][x + 1]) {
		            next.add(y * w + x + 1);
		            field[y][x + 1] = true;
		        }
		    }
		    ArrayDeque<Integer> tmp = next;
		    next = deq;
		    deq = tmp;
		}
		System.out.println(count - 1);
    }
}

