#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MN = 402;
int E = 1;
int la[MN * MN * 4], nxt[MN * MN * 4], oppo[MN * MN * 4];
void add(int u, int v) {
nxt[E] = la[u];
la[u] = E;
oppo[E] = v;
E++;
}
int N, M;
char G[MN][MN];
vector<int> sadj[MN * MN * 2];
int tin[MN * MN * 2], bck[MN * MN * 2], id[MN * MN * 2], sz[MN * MN * 2], timer = 1, scnt = 1;
stack<int> stk;
inline int f(int r, int c, int t) {
return r * (2 * M) + c * 2 + t;
}
void dfs(int u) {
tin[u] = timer++;
bck[u] = tin[u];
stk.push(u);
for(int i = la[u]; i; i = nxt[i]) {
int v = oppo[i];
if(!tin[v]) {
dfs(v);
bck[u] = min(bck[u], bck[v]);
}
else if(!id[v]) {
bck[u] = min(bck[u], tin[v]);
}
}
if(bck[u] == tin[u]) {
while(1) {
int t = stk.top(); stk.pop();
id[t] = scnt;
if(t == u) break;
}
scnt++;
}
}
bool del[MN * MN * 2], chk[MN * MN * 2];
int q[1000010], head, tail;
void scc() {
for(int i = 0; i < N * M * 2; i++) if(!tin[i]) {
dfs(i);
}
for(int i = 0; i < N * M * 2; i++) {
sz[ id[i] ]++;
for(int j = la[i]; j; j = nxt[j]) {
int k = oppo[j];
if(id[i] == id[k]) continue;
sadj[ id[i] ].push_back(id[k]);
}
}
head = tail = 0;
for(int i = 0; i < scnt; i++) {
if(sz[i] > 1) {
q[tail++] = i;
del[i] = 1;
}
}
while(head != tail) {
int u = q[head++];
for(int i = 0; i < sadj[u].size(); i++) {
int v = sadj[u][i];
if(!del[v]) {
q[tail++] = v;
del[v] = 1;
}
}
}
for(int i = 0; i < N * M * 2; i++) {
chk[i] = del[ id[i] ];
}
}
int ans[MN * MN * 2], vis[MN * MN * 2];
int main() {
scanf("%d %d", &N, &M);
for(int i = 0; i < N; i++) {
getchar();
for(int j = 0; j < M; j++) {
G[i][j] = getchar();
}
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
for(int k = 0; k < 2; k++) {
if(k) {
if(i) add(f(i - 1, j, k), f(i, j, k));
}
else if(i < N - 1) add(f(i + 1, j, k), f(i, j, k));
if(k ^ (G[i][j] == 'N')) {
if(j) add(f(i, j - 1, G[i][j - 1] == 'Z'), f(i, j, k));
}
else if(j < M - 1) add(f(i, j + 1, G[i][j + 1] == 'N'), f(i, j, k));
}
}
}
scc();
int pos = 1;
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
int k = G[i][j] == 'N';
if(chk[ f(i, j, k) ]) continue;
head = tail = 0;
q[tail++] = f(i, j, k);
ans[ f(i, j, k) ] += M - j;
vis[ f(i, j, k) ] = pos;
while(head != tail) {
int u = q[head++];
for(int x = la[u]; x != 0; x = nxt[x]) {
int v = oppo[x];
if(!chk[v] && vis[v] != pos) {
q[tail++] = v;
ans[v] += M - j;
vis[v] = pos;
}
}
}
}
pos++;
}
for(int i = 0; i < N; i++) {
for(int j = M - 1; j >= 0; j--) {
int k = G[i][j] == 'Z';
if(chk[ f(i, j, k) ]) continue;
head = tail = 0;
q[tail++] = f(i, j, k);
ans[ f(i, j, k) ] += j + 1;
vis[ f(i, j, k) ] = pos;
while(head != tail) {
int u = q[head++];
for(int x = la[u]; x != 0; x = nxt[x]) {
int v = oppo[x];
if(!chk[v] && vis[v] != pos) {
q[tail++] = v;
ans[v] += j + 1;
vis[v] = pos;
}
}
}
}
pos++;
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
if(chk[ f(i, j, 0) ] && chk[ f(i, j, 1) ]) printf("-1 ");
else if(chk[ f(i, j, 0) ]) printf("%d ", 2 * ans[ f(i, j, 1) ]);
else if(chk[ f(i, j, 1) ]) printf("%d ", 2 * ans[ f(i, j, 0) ]);
else printf("%d ", 2 * min(ans[ f(i, j, 0) ], ans[ f(i, j, 1) ]));
}
printf("\n");
}
}
