#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<string> s(n);
  rep(i, n) cin >> s[i];
  reverse(all(s));
  VI dp(m), ndp;
  VI upd, nxt_wall;
  priority_queue<P, vector<P>, greater<P>> q;
  for (auto& s : s) {
    constexpr int INF = 1001001001;
    rep(j, m) if (s[j] == '#') dp[j] = INF;
    ndp.assign(m, INF);
    rep(_, 2) {
      upd.assign(m+1, -INF);
      nxt_wall.assign(m + 1, m);
      rrep(j, m) {
        nxt_wall[j] = s[j] == '#' ? j : nxt_wall[j+1];
      }
      int lmx = -INF;
      rep(j, m) {
        if (s[j] == '#') {
          lmx = -INF;
          while (q.size()) q.pop();
          continue;
        }
        int x = dp[j];
        q.emplace(x, min(j + x, nxt_wall[j]));
        if (j + x < nxt_wall[j]) chmax(upd[j+x], j);
        chmax(lmx, upd[j]);
        while (q.size() && q.top().second < j) q.pop();
        chmin(ndp[j], j - lmx);
        if (q.size()) chmin(ndp[j], q.top().first);
      }
      while (q.size()) q.pop();
      reverse(all(dp));
      reverse(all(ndp));
    }
    swap(dp, ndp);
  }
  rep(j, m) cout << dp[j] << '\n';
}