#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
const int N=110;
int n,m,d[N][N];
struct punct
{
    short int lin,col;
};
queue <punct> q;
const short int dlin[]={-1,0,1,0};
const short int dcol[]={0,1,0,-1};
void lee()
{
    punct x,y;
    //q.push(x0);
    //d[x0.lin][x0.col]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0;i<4;i++)
        {
            y.lin=x.lin+dlin[i];
            y.col=x.col+dcol[i];
            if(d[y.lin][y.col]==0)
            {
                d[y.lin][y.col]=1+d[x.lin][x.col];
                q.push(y);
            }
        }
    }

}

void bordare()
{
    for(int i=0;i<=n+1;i++)
		d[i][0]=d[i][m+1]=-2;
	for(int j=0;j<=m+1;j++)
		d[0][j]=d[n+1][j]=-2;
}

int main()
{
    punct r,jul;
    char x;
    int i,j;
    in>>n>>m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        in>>x;
        if(x=='X')
            d[i][j]=-1;
        if(x=='R')
        {
            r.lin=i;
            r.col=j;
            q.push(r);
            d[r.lin][r.col]=1;
        }
        if(x=='J')
        {
            jul.lin=i;
            jul.col=j;
            q.push(jul);
            d[jul.lin][jul.col]=1;
        }
    }
    bordare();
    lee();

    for(int i=1 ; i<=n ; i++)
    {
        for(int j=1 ; j<=n ; j++)
            out << d[i][j] << "\t";
        out << "\n";
    }

    //out<<d[y.lin][y.col];
    return 0;
}