#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;
const int NMAX = 101;
int ropod;
int raj[NMAX][NMAX];
int pju[NMAX][NMAX];
int tdmin,n,m,i,j,rajI,rajJ,pjuI,pjuJ;

int di[] = {-1, -1, 0 , 1, 1, 1, 0 , 1};
int dj[] = {0, -1, -1 , -1, 0, 1 , 1, 1};


int main()
{
    freopen("rj.in","r", stdin );
    freopen("rj.out","w", stdout );

    scanf("%d %d", &n, &m);

    for (i=0;i<=n+1;i++)
    raj[i][0]=raj[i][n+1] = pju[i][0] = pju[i][n+1] = -1;

    for(j=0;j<=n+1;j++)
    raj[0][j]=raj[n+1][j]=pju[0][j]=pju[n+1][j]=-1;

    for (i=1;i<=n;i++){
        for (j=1;j<=m; j++){
            char c = getchar();
            switch (c) {
            case 'R': rajI = i, rajJ=j;
                        break;
            case 'J': pjuI=i, pjuJ=j;
                        break;
            case 'X': raj[i][j]=pju[i][j]=-1; break;
            }
        }
        getchar();

    }
    return 0;
}