#if 1
#define ssh(x)<x>
#include ssh(bits/stdc++.h)
#define rfor(x...)for(register x)
#define rep(i,l,r)rfor(ll i=l;i<=r;i++)
#define ref(i,l,r)rfor(ll i=l;i<r;i++)
#define per(i,l,r)rfor(ll i=l;i>=r;i--)
#define rev(i,u,v)rfor(ll i=head[u],v;v=to[i],i;i=next[i])
#define rej(i,s)rfor(ll i=s;i;i=(i-1)&(s))
#define red(i,n)rfor(ll i=n;i;i>>=1)
#define IO(x...)((*#x!='/'||#x[1])&&(*#x&&freopen(#x".in","r",stdin)&&freopen(#x".out","w",stdout),gc=fgc,pc=fpc,atexit(fout)))
typedef long long ll;
typedef const ll cll;
typedef unsigned long long ull;
cll N = 433 * 433 * 2, mod = 1e9 + 7, iz = 4096, oz = 4096;
typedef ll aN[N];
char is[iz], *i1 = is, *i2 = is, os[oz], *o1 = os, *o2 = os + oz;
int fgc() {
    return i1 == i2 && is == (i2 = is + fread(i1 = is, 1, iz, stdin)) ? -1 : *i1++;
}
void fout() {
    fwrite(os, o1 - os, 1, stdout), o1 = os;
}
int fpc(int c) {
    if (o1 == o2)
        fout();

    return*o1++ = c;
}
int(*gc)() = getchar, (*pc)(int) = putchar, wt[126];
int readchar(int l = 33, int r = 126) {
    if (l > r)
        std::swap(l, r);

    int c = gc();

    for (; c < l || c > r; c = gc());

    return c;
}
ll readll() {
    ll x = 0, w = 1;
    int c = gc();

    for (; c < 48 || c > 57; c = gc())
        c - 45 || (w = -w);

    for (; c > 47 && c < 58; c = gc())
        x = x * 10 + c - 48;

    return x * w;
}
void writell(cll u, int c = 32) {
    int t = 0;
    rfor(ull n = u < 0 ? pc(45), 0ull - u : u; n; n /= 10)wt[++t] = n % 10 ^ 48;

    for (t || pc(48); t;)
        pc(wt[t--]);

    c &&pc(c);
}
int mygets(char *s, int c = 0) {
    char *t = s + 1;

    while ((*s = gc()) < 33);

    while ((*t = gc()) > 32)
        t++;

    c &&(*t++ = c), *t = 0;
    return t - s;
}
int myputs(const char *s, int c = 10) {
    const char *t = s;

    while (*t)
        pc(*t++);

    c &&pc(c);
    return t - s + (c != 0);
}
cll IO_res = IO(), n = readll(), m = readll();
bool p1;
cll d[] = {1 << 2, (-m - 1) * 4, (m + 1) << 2, (-1) * 4};
char s[163200];
unsigned int ans[400];
unsigned int cnt = 0;
void dfs(unsigned int u) {
    if ((int)u < 0)
        return;

    //printf("%u %u %u %d\n",u,u>>2,u&3,s[u>>2]>>2);
    if ((s[u >> 2] & 12) == 4)
        cnt = -1;

    if (s[u >> 2] & 2 || !~cnt)
        return;

    s[u >> 2] |= 4, s[u >> 2] |= 2, cnt += 2;

    switch (s[u >> 2] & 1) {
    case 0:
        switch (u & 3) {
        case 0:
            dfs((u + d[0]) ^ 0);
            dfs((u + d[2]) ^ 2);
            break;

        case 1:
            dfs((u + d[1]) ^ 0);
            dfs((u + d[3]) ^ 2);
            break;

        case 2:
            dfs((u + d[0]) ^ 2);
            dfs((u + d[2]) ^ 0);
            break;

        case 3:
            dfs((u + d[1]) ^ 2);
            dfs((u + d[3]) ^ 0);
            break;
        }

        break;

    case 1:
        switch (u & 3) {
        case 0:
            dfs((u + d[0]) ^ 0);
            dfs((u + d[1]) ^ 1);
            break;

        case 1:
            dfs((u + d[0]) ^ 1);
            dfs((u + d[1]) ^ 0);
            break;

        case 2:
            dfs((u + d[2]) ^ 0);
            dfs((u + d[3]) ^ 1);
            break;

        case 3:
            dfs((u + d[2]) ^ 1);
            dfs((u + d[3]) ^ 0);
            break;
        }
    }

    s[u >> 2] &= ~4;
}
bool p2;
int main() {
    fprintf(stderr, "%fMiB\n", (&p2 - &p1) / 1046576.0);
    memset(s, -1, sizeof s);
    ref(i, 0, n)mygets(s + i * (m + 1));
    per(i, n * (m + 1) - 1, 0)s[i] = s[i] == 'N' ? 1 : s[i] == 'Z' ? 0 : -1;
    //ref(i,0,n*(m+1))printf("%d\n",s[i]);
    //ll cnt=0;
    ref(i, 0, n) {
        //fprintf(stderr,"%lld %lld\n",i,cnt);
        cnt = 0;
        ref(j, 0, m)dfs((i * (m + 1) + j) << 2 | 3), ans[j] = cnt;

        ref(i, 0, n * (m + 1))if (s[i] != -1)
            s[i] &= 1;

        cnt = 0;
        per(j, m - 1, 0)dfs((i * (m + 1) + j) << 2 | 0), ans[j] = std::min(ans[j], cnt);

        ref(i, 0, n * (m + 1))if (s[i] != -1)
            s[i] &= 1;

        ref(j, 0, m)writell((int)ans[j], j == m - 1 ? 10 : 32);
    }
    return 0;
}
/*
2 4
NZZZ
ZNZZ
2 2
NZ
ZN
3 2
ZZ
ZZ
ZZ
5 4
ZZNZ
ZZZN
ZZNZ
NZZZ
ZNZZ
4 4
ZZNZ
ZZNN
NZZZ
ZNZZ
5 5
ZZZNZ
ZZZZN
ZZZZZ
NZZZZ
ZNZZZ
*/
#else
// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
#define IO(x...)((*#x!='/'||#x[1])&&(*#x&&freopen(#x".in","r",stdin)&&freopen(#x".out","w",stdout)))
const int xx[4] = {-1, 0, +1, 0}, yy[4] = {0, +1, 0, -1};
int n, m, ans[405][405], tot;
bool marked[405][405], vis[405][405];
char a[405][405];
bool work(int x, int y, int from) {
    if (marked[x][y])
        return true;

    if (vis[x][y])
        return false;

    vis[x][y] = true;

    switch (a[x][y]) {
    case 'N':
        switch (from) {
        case 0:
        case 1:
            if (!work(x - xx[0], y - yy[0], 0) || !work(x - xx[1], y - yy[1], 1))
                return false;

            break;

        case 2:
        case 3:
            if (!work(x - xx[2], y - yy[2], 2) || !work(x - xx[3], y - yy[3], 3))
                return false;

            break;
        }

        break;

    case 'Z':
        switch (from) {
        case 0:
        case 3:
            if (!work(x - xx[0], y - yy[0], 0) || !work(x - xx[3], y - yy[3], 3))
                return false;

            break;

        case 1:
        case 2:
            if (!work(x - xx[1], y - yy[1], 1) || !work(x - xx[2], y - yy[2], 2))
                return false;

            break;
        }
    }

    tot += 2;
    return marked[x][y] = true;
}
void cmin(int &A, int B) {
    A = std::min(A, B);
}
signed main() {
    IO(sandwish);
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m;

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            std::cin >> a[i][j], ans[i][j] = INT_MAX;

    std::memset(marked, true, sizeof(marked));

    for (int i = 1; i <= n; ++i) {
        for (int k = 1; k <= n; ++k)
            for (int l = 1; l <= m; ++l)
                marked[k][l] = vis[k][l] = false;

        tot = 0;

        for (int j = 1; j <= m; ++j)
            if (work(i, j, 1))
                cmin(ans[i][j], tot);

        for (int k = 1; k <= n; ++k)
            for (int l = 1; l <= m; ++l)
                marked[k][l] = vis[k][l] = false;

        tot = 0;

        for (int j = m; j; --j)
            if (work(i, j, 3))
                cmin(ans[i][j], tot);
    }

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            std::cout << (ans[i][j] == INT_MAX ? -1 : ans[i][j]) << " \n"[j == m];

    return 0;
}
#endif