#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

int W, H;
int map[3010][3010] = { 0 };
char c[3010];

int dx[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
int dy[] = { 1, 0, -1, 0, 1, -1, 1, -1 };

bool isInside(int x, int y) {
    return 0 <= x && x < W + 2 && 0 <= y && y < H + 2;
}

int main(void)
{
    cin >> H >> W;
    int M = min(H, W) / 2;

    for (int i = 1; i <= H; i++) {
        scanf("%s", c);
        for (int j = 1; j <= W; j++) {
            if(c[j - 1] == '#') map[i][j] = 1510;
        }
    }

    for (int k = 0; k <= M; k++) {
        for (int i = 0; i < H + 2; i++) {
            for (int j = 0; j < W + 2; j++) {
                if (map[i][j] == k) {
                    for (int d = 0; d < 8; d++) {
                        if (isInside(j + dx[d], i + dy[d])) {
                            map[i + dy[d]][j + dx[d]] = min(map[i + dy[d]][j + dx[d]], k + 1);
                        }
                    }
                }
            }
        }
    }

    int ans = 0;

    for (int i = 1; i <= H; i++) {
        for (int j = 1; j <= W; j++) {
            ans = max(ans, map[i][j]);
        }
    }

    cout << ans << endl;
    return 0;
}