#include <iostream>
#include <cstdio>
#include<queue>
using namespace std;

const int NMAX=105;

int n,m;
int romeo[NMAX][NMAX], juliet[NMAX][NMAX];

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

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

    for(int i=0;i<=n;i++)
        romeo[i][0]=romeo[i][m+1]=juliet[i][0]=juliet [i][m+1]=-1;

    for(int j=0;j<=m;j++)
        romeo[0][j]=romeo[n+1][j]=juliet[0][j]=juliet[n+1][j]=-1;

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            char c=getchar();

        switch (c)
        {
        case 'R':
           romeoI=i, romeoJ=j;
            break;
        case 'J':
            julietI=i; julietJ=j;
            break;
        case 'X':
            romeo[i][j]=juliet [i][j]=-1;
        }

    }
    getchar();
    }

    return 0;
}