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<iostream>
#include<algorithm>
#include<queue>
#include<string>
using namespace std;
int a[1010][1010];
int n, m;
string s;
queue<pair<int, int>>q;
int deep = 1, cnt = 0, len = 0;
void add(int x, int y) {
	if (x >= 0 && x < n && y >= 0 && y < m) {
		if (a[x][y] == 0) {
			q.push({ x,y });
			a[x][y] = deep;
			++cnt;
		}
	}
}
int main() {
	int i, j;
	cin >> n >> m;
	for (i = 0; i < n; ++i) {
		cin >> s;
		for (j = 0; j < m; ++j) {
			if (s[j] == '#') {
				q.push({ i,j });
				a[i][j] = 1;
				++len;
			}
			else a[i][j] = 0;
		}
	}
	while (!q.empty()) {
		++deep;
		while (len--) {
			pair<int, int>t = q.front();
			q.pop();
			int x = t.first, y = t.second;
			add(x - 1, y), add(x + 1, y), add(x, y - 1), add(x, y + 1);
		}
		len = cnt;
		cnt = 0;
	}
	cout << deep - 2 << endl;
	return 0;
}