#include <bits/stdc++.h>
using namespace std;

int n, m, ans = 0, dp[32][32][32][32], idx;
int temp[1024], nbtemp;
string board[32], rot[32]; 

int ngitung(int rows, int cols){
	for(int a=1; a<=rows; a++){
		for(int b=0; b+a<=rows; b++){
			for(int c=1; c<=cols; c++){
				for(int d=0; d+c<=cols; d++){
					nbtemp = 0;
					for(int e=0; e<a; e++){
						for(int f=0; f<c; f++){
							if(rot[b+e][d+f] == 'R'){
								temp[nbtemp] = dp[e][b][c][d] ^ dp[a-1-e][b+e+1][c][d];
								nbtemp++;
							}else if(rot[b+e][d+f] == 'B'){
								temp[nbtemp] = dp[a][b][f][d] ^ dp[a][b][c-1-f][d+f+1];
								nbtemp++;
							}else if(rot[b+e][d+f] == 'G'){
								temp[nbtemp] = dp[e][b][f][d] ^ dp[e][b][c-1-f][d+f+1] ^ dp[a-1-e][b+e+1][f][d] ^ dp[a-1-e][b+e+1][c-1-f][d+f+1];
								nbtemp++;
							}
						}
					}
					sort(temp, temp + nbtemp);
					dp[a][b][c][d] = 0;
					idx = 0;
					while(idx < nbtemp && temp[idx] <= dp[a][b][c][d]){
						dp[a][b][c][d] += (temp[idx] == dp[a][b][c][d]);
						idx++;
					}
				}
			}
		}
	}
	return dp[rows][0][cols][0];
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	for(int i=0; i<n; i++){
		cin >> board[i];
	}
	// rot genap
	for(int i=0; i<(n+m)/2; i++){
		rot[i] = "";
		for(int j=-n/2; j<=m/2; j++){
			int x = i-j;
			int y = i+j;
			rot[i] += " ";
			if(0 <= x && x < n && 0 <= y && y < m){
				rot[i][rot[i].length()-1] = board[x][y];
			}
		}
	}
	ans = ngitung((n+m)/2, n/2 + 1 + m/2) ^ ans;
	// rot ganjil

	for(int i=0; i<(n+m)/2; i++){
		rot[i] = "";
		for(int j=-n/2; j<=m/2; j++){
			int x = i-j+1;
			int y = i+j;
			rot[i] += " ";
			if(0 <= x && x < n && 0 <= y && y < m){
				rot[i][rot[i].length()-1] = board[x][y];
			}
		}
	}
	ans = ngitung((n+m)/2, n/2 + 1 + m/2) ^ ans;
	if(ans > 0){
		cout << "W" << endl;
	}else{
		cout << "L" << endl;
	}

}