#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 27;

int n,m,val[N][N],dp[N][N][N][N];
char a[N][N];
bool vis[2 * N];

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m;
	for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) cin >> a[i][j];
	int res=0;
	for(int _=0; _<2; ++_){
		int mn1=1e9,mx1=-1e9,mn2=1e9,mx2=-1e9;
		for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) if((i+j)%2==_){
			mn1=min(mn1,i+j),mx1=max(mx1,i+j);
			mn2=min(mn2,i-j),mx2=max(mx2,i-j);
		}
		if(mn1>mx1) continue;
		memset(val,-1,sizeof val),memset(dp,0,sizeof dp);
		int h=(mx1-mn1)/2+1,w=(mx2-mn2)/2+1;
		for(int i=0; i<n; ++i) for(int j=0; j<m; ++j) if((i+j)%2==_){
			int ii=(i+j-mn1)/2,jj=(i-j-mn2)/2;
			if(a[i][j]=='R') val[ii][jj]=0;
			else if(a[i][j]=='B') val[ii][jj]=1;
			else val[ii][jj]=2;
		}
		for(int l1=1; l1<=h; ++l1) for(int l2=1; l2<=w; ++l2){
			for(int i1=0; i1+l1<=h; ++i1) for(int i2=0; i2+l2<=w; ++i2){
				int j1=i1+l1,j2=i2+l2;
                                for(int i=0; i<2*N; ++i) vis[i]=false;
				for(int i=i1; i<j1; ++i) for(int j=i2; j<j2; ++j) if(val[i][j]>=0){
					int x=-1;
					if(val[i][j]==0){
						x=dp[i1][i][i2][j2]^dp[i+1][j1][i2][j2];
					}
					else if(val[i][j]==1) x=dp[i1][j1][i2][j]^dp[i1][j1][j+1][j2];
					else x=dp[i1][i][i2][j]^dp[i1][i][j+1][j2]^dp[i+1][j1][i2][j]^dp[i+1][j1][j+1][j2];
					vis[x]=1;
				}
				for(int i=0; i<h+w+2; ++i) if(!vis[i]){
					dp[i1][j1][i2][j2]=i;
					break;
				}
			}
		}
		res^=dp[0][h][0][w];
	}
	cout << (res?'W':'L') << "\n";
}