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.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;

public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);

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

    char[][] c_array = new char[h][w];


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



    int ans = solve(c_array);
    System.out.println(ans);

  }

  public static int solve(char[][] c){
    int ret = 0;
    int h = c.length;
    int w = c[0].length;

    Deque<Position> p = new ArrayDeque<>();

    for(int i=0; i<h; i++){
      for(int j=0; j<w; j++){
        if(c[i][j]=='#'){
          p.add(new Position(i,j,0));
        }
      }
    }


    while(p.size()>0){
      Position xy = p.poll();
      int x = xy.x;
      int y = xy.y;
      int depth = xy.d;

      if(depth>ret){
        ret = depth;
      }

      if(x+1<w && c[y][x+1]=='.'){
        c[y][x+1] = '#';
        p.add(new Position(y,x+1,depth+1));
      }
      if(x-1>=0 && c[y][x-1]=='.'){
        c[y][x-1] = '#';
        p.add(new Position(y,x-1,depth+1));
      }
      if(y+1<h && c[y+1][x]=='.'){
        c[y+1][x] = '#';
        p.add(new Position(y+1,x,depth+1));
      }
      if(y-1>=0 && c[y-1][x]=='.'){
        c[y-1][x] = '#';
        p.add(new Position(y-1,x,depth+1));
      }




    }



    return ret;
  }
}

class Position{
  Position(int y , int x, int d){
    this.x = x; this.y = y; this.d = d;
  }


  int x;
  int y;
  int d;
}