#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

int inf = 1001001001;

struct SparseTable {//質問 l = r で壊れる
    vector<int>A;
    vector<int>log_table;
    vector<vector<int>>table;
    SparseTable(int n,vector<int> a) {
        A = a;
        int k = 0;
        int tmp = 1;
        while(tmp <= n) {
            k++;
            tmp *= 2;
        }
        log_table.resize(n+1);
        table.resize(k+1);
        for(int i = 0; i <= k; i++) {
            table[i].resize(n);
        }
        tmp = 1;
        log_table[0] = -1;
        for(int i = 1; i <= n; i++) {
            log_table[i] = log_table[i-1];
            if(tmp == i) {
                log_table[i]++;
                tmp *= 2;
            }
        }
        for(int i = 0; i <= k; i++) {
            for(int j = 0; j < n; j++) {
                if(i == 0) {
                    table[i][j] = j;
                }
                else {
                    table[i][j] = table[i-1][j];
                    if(j+(1 << (i-1)) < n && a[table[i-1][j]] > a[table[i-1][j+(1 << (i-1))]]) {
                        table[i][j] = table[i-1][j+(1 << (i-1))];
                    }
                }
            }
        }
    }
    // [l,r)
    int query(int l,int r) {
        int len = log_table[r-l];
        return min(A[table[len][l]],A[table[len][r-(1 << len)]]);
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H,W;
    cin >> H >> W;
    vector<string>S(H);
    for(int i = 0; i < H; i++) {
        cin >> S[i];
    }
    vector<int>A(W,0);
    SparseTable now(W,A);
    for(int i = H-2; i >= 0; i--) {
        vector<int>nxt(W,inf);
        int mi = -1;
        for(int j = 0; j < W; j++) {
            if(S[i][j] == '#') {
                mi = j;
                continue;
            }
            int l = -1,r = W;
            while(l+1 < r) {
                int mid = (l+r)/2;
                if(now.query(max(mi+1,j-mid),j+1) <= mid) {
                    r = mid;
                }
                else {
                    l = mid;
                }    
            }
            if(r != W) {
                nxt[j] = r;
            }
        }
        mi = W;
        for(int j = W-1; j >= 0; j--) {
            if(S[i][j] == '#') {
                mi = j;
                continue;
            }
            int l = -1,r = W;
            while(l+1 < r) {
                int mid = (l+r)/2;
                if(now.query(j,min(mi-1,j+mid)+1) <= mid) {
                    r = mid;
                }
                else {
                    l = mid;
                }    
            }
            if(r != W) {
                nxt[j] = min(nxt[j],r);
            }
        }
        SparseTable nsp(W,nxt);
        now = nsp;
    }
    for(int i = 0; i < W; i++) {
        cout << now.query(i,i+1) << "\n";
    }
}