#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}

template<class T>
struct sparseTable{
  vector<vector<T> > table;
  function<T(const T&, const T&)> comb;
  int size = 0;

  sparseTable(vector<T> base, function<T(const T&, const T&)> _comb) {
    comb = _comb;
    size = base.size();
    table.resize(bit_width((unsigned)size), std::vector<T>(size));
    
    table[0] = base;
    for(int i = 1; i < ssize(table); i++) {
      for(int j = 0; j < size; j++) {
        if (j + (1 << (i - 1)) < size)
          table[i][j] = comb(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
        else
          table[i][j] = table[i - 1][j];
      }
    }
  }

  T query(int l, int r) {
    int range = bit_width((unsigned)(r - l)) - 1;
    return comb(table[range][l], table[range][r - (1 << range)]);
  }
};

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int h, w; cin >> h >> w;
  vector<string> s(h);
  for(string &x : s)
    cin >> x;

  vector dp(h, vector<int>(w, LLONG_MAX));
  dp[h - 1] = vector<int>(w, 0);
  for(int i = h - 2; i >= 0; i--) {
    vector<int> pre(w), nxt(w);
    iota(pre.begin(), pre.end(), 0);
    iota(nxt.begin(), nxt.end(), 0);
    for(int j = 1; j < w; j++)
      if (s[i][j] == '.' and s[i][j - 1] == '.')
        pre[j] = pre[j - 1];
    for(int j = w - 2; j >= 0; j--)
      if (s[i][j] == '.' and s[i][j + 1] == '.')
        nxt[j] = nxt[j + 1];
    sparseTable<int> st(dp[i + 1], [](const int &l, const int &r) { return min(l, r); });
    for(int j = 0; j < w; j++) {
      if (s[i][j] == '#') continue;
      int res = *R::partition_point(V::iota(0, w), [&](int d) -> bool {
        int ql = max(j - d, pre[j]), qr = min(j + d, nxt[j]) + 1;
        return st.query(ql, qr) >= d;
      });
      int ql = max(j - res, pre[j]), qr = min(j + res, nxt[j]) + 1;
      dp[i][j] = max(st.query(ql, qr), res);
      if (i == 1 and j == 0) {dbg(dp[i][j]); dbg(res); };
      if (res > 0) {
        ql = max(j - (res - 1), pre[j]), qr = min(j + (res - 1), nxt[j]) + 1;
        dp[i][j] = min(dp[i][j], max(st.query(ql, qr), res - 1));
      }
      if (i == 1 and j == 0) {dbg(dp[i][j]); dbg(res); };
    }
  }

  for(int x : dp[0])
    cout << x << '\n';

  for(auto v : dp)
    dbg(v);

  return 0;
}