#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    int H,W;
    cin>>H>>W;
    vector<string> S(H);
    rep(i,0,H) cin>>S[i];
    reverse(all(S));
    vector<int> p,q;
    vector<vector<pair<int,int>>> G(W);
    p.reserve(W);
    q.reserve(W);
    vector<int> dp(W),n_dp(W);
    auto f=[&](int l) -> void {
        int N=p.size();
        q.resize(N,INF);
        rep(i,0,N){
            int ind;
            ind=i+p[i];
            if(ind<N) chmin(q[ind],p[i]),G[ind].push_back({p[i],-1});
            ind=i-p[i];
            if(ind>=0) chmin(q[ind],p[i]);
            G[max(0,ind)].push_back({p[i],1});
        }
        rep(i,0,N-1) chmin(q[i+1],q[i]+1);
        for(int i=N-1;i>0;i--) chmin(q[i-1],q[i]+1);
        map<int,int> m;
        m[INF]=1;
        rep(i,0,N){
            for(auto x:G[i]){
                m[x.first]+=x.second;
                if(m[x.first]==0) m.erase(x.first);
            }
            G[i].clear();
            n_dp[l+i]=min(q[i],(*m.begin()).first);
        }
    };
    rep(i,0,H){
        for(auto &x:n_dp) x=INF;
        rep(j,0,W) if(S[i][j]=='#') dp[j]=INF;
        int l=0;
        rep(r,0,W+1){
            if(r==W||S[i][r]=='#'){
                if(!p.empty()){
                    f(l);
                    p.clear();
                    q.clear();
                }
                l=r+1;
            }
            else p.push_back(dp[r]);
        }
        swap(n_dp,dp);
    }
    for(auto x:dp) cout<<x<<"\n";
}