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
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 7, maxm = 1e6 + 7;
int D[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n, m, vis[maxn][maxn];
char r[maxn];

struct Node{
	int x, y;
}node[maxm];
int s = 1, t = 0;

void bfs() {
	int x, y, X, Y;
	while(s <= t) {
		x = node[s].x; y = node[s].y;
		++s;
		for (int i = 0; i < 4; ++i) {
			X = x + D[i][0];
			Y = y + D[i][1];
			if(~vis[X][Y]) continue;
			vis[X][Y] = vis[x][y] + 1;
			node[++t].x = X; node[t].y = Y;
		}
	}
	printf("%d\n", vis[x][y]);
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) vis[i][j] = -1;
	for (int i = 1; i <= n; ++i) {
		scanf("%s", r + 1);
		for (int j = 1; j <= m; ++j) if(r[j] == '#') {
			node[++t].x = i; node[t].y = j;
			vis[i][j] = 0;
		}
	}
	bfs();
	return 0;
}