#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll INF = 10000000000005;

int main() {
    ll H, W;
    cin >> H >> W;
    vector<string> S(H);
    for (ll i = 0; i < H; i++) {
        cin >> S[i];
    }
    vector<vector<ll>> dp(H, vector<ll>(W, INF));
    for (ll j = 0; j < W; j++){
        dp[H - 1][j] = 0;
    }
    for (ll i = H - 1; i > 0; i--){
        vector<pll> vec(0);
        for (ll j = 0; j < W; j++){
            if (S[i][j] == '.' && S[i - 1][j] == '.'){
                vec.push_back(pll(dp[i][j], j));
            }
        }
        vector<ll> no_wall(0);
        no_wall.push_back(-INF);
        for (ll j = 0; j < W; j++){
            if (S[i][j] == '.'){
                no_wall.push_back(j);
            }
        }
        no_wall.push_back(INF);
        sort(all(vec));
        
        for (ll j = 0; j < vec.size(); j++){
            ll val = vec[j].first;
            ll idx = vec[j].second;
            if (dp[i - 1][idx] < INF){
                continue;
            }
            dp[i - 1][idx] = val;
            for (ll k = 1; k <= val; k++){
                if (idx - k < 0){
                    break;
                }
                else if (S[i - 1][idx - k] == '#'){
                    break;
                }
                else if (dp[i - 1][idx - k] < INF){
                    break;
                }
                dp[i - 1][idx - k] = val;
            }
            for (ll k = 1; k <= val; k++){
                if (idx + k >= W){
                    break;
                }
                else if (S[i - 1][idx + k] == '#'){
                    break;
                }
                else if (dp[i - 1][idx + k] < INF){
                    break;
                }
                dp[i - 1][idx + k] = val;
            }
        }
        for (ll j = 0; j < W; j++){
            if (S[i - 1][j] == '.' && dp[i - 1][j] == INF){
                ll val = INF;
                auto itr = lower_bound(all(no_wall), j);
                val = min(val, *itr - j);
                itr--;
                val = min(val, j - *itr);
                dp[i - 1][j] = val;
            }
        }
        // debug(dp);
    }
    for (ll j = 0; j < W; j++){
        cout << dp[0][j] << endl;
    }
}