#include<bits/stdc++.h>
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define all(v) begin(v),end(v)
using namespace std;
using ll = long long;
bool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }

typedef unsigned long long ull;
int grundy[60][60][60][60];
bool seen[60][60][60][60];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int h, w; cin >> h >> w;

    vector<char> c(h*w);
    rep(i,0,h*w){
        cin >> c[i];
    }

    auto calc = [&](auto self, int ppl, int ppr, int pml, int pmr) -> int {
        if (ppl > ppr) return 0;
        if (pml > pmr) return 0;
        if (seen[ppl][ppr][pml][pmr]) return grundy[ppl][ppr][pml][pmr];
        set<int> gset;
        rep(i,0,h){
            rep(j,0,w){
                int pp = i + j;
                int pm = i - j + 30;
                if (pp % 2 != ppl % 2) {
                    assert(pm % 2 != pml % 2);
                    assert(pm % 2 != pmr % 2);
                    assert(pp % 2 != ppr % 2);
                    continue;
                }
                if (!(ppl <= pp && pp <= ppr)) continue;
                if (!(pml <= pm && pm <= pmr)) continue;
                if (c[i*w+j] == 'R') {
                    int g1 = self(self, ppl, pp-2, pml, pmr);
                    int g2 = self(self, pp+2, ppr, pml, pmr);
                    gset.insert(g1 ^ g2);
                }else if(c[i*w+j] == 'B') {
                    int g1 = self(self, ppl, ppr, pml, pm-2);
                    int g2 = self(self, ppl, ppr, pm+2, pmr);
                    gset.insert(g1 ^ g2);
                }else{
                    assert(c[i*w+j] == 'G');
                    int g1 = self(self, ppl, pp-2, pml, pm-2);
                    int g2 = self(self, ppl, pp-2, pm+2, pmr);
                    int g3 = self(self, pp+2, ppr, pml, pm-2);
                    int g4 = self(self, pp+2, ppr, pm+2, pmr);
                    gset.insert(g1 ^ g2 ^ g3 ^ g4);
                }
            }
        }
        int piv = 0;
        while(gset.find(piv) != gset.end()) {
            piv += 1;
        }
        grundy[ppl][ppr][pml][pmr] = piv;
        seen[ppl][ppr][pml][pmr] = 1;
        return piv;
    };

    int ppl1 = 1e9, ppr1 = -1e9, pml1 = 1e9, pmr1 = -1e9;
    int ppl2 = 1e9, ppr2 = -1e9, pml2 = 1e9, pmr2 = -1e9;

    rep(i,0,h){
        rep(j,0,w){
            if ((i+j)%2==0){
                chmin(ppl1, i+j);
                chmax(ppr1, i+j);
                chmin(pml1, i-j+30);
                chmax(pmr1, i-j+30);
            }else{
                chmin(ppl2, i+j);
                chmax(ppr2, i+j);
                chmin(pml2, i-j+30);
                chmax(pmr2, i-j+30);
            }
        }
    }

    int g1 = calc(calc, ppl1, ppr1, pml1, pmr1);
    int g2 = calc(calc, ppl2, ppr2, pml2, pmr2);

    int g = g1 ^ g2;
    if (g == 0) {
        cout << "L\n";
    }else{
        cout << "W\n";
    }

    
}