#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const int C = 25;
string mp[25];
int dp[30][30][30][30], clr[30][30], vis[100000];

int get_clr(char c) {
    if (c == 'R') return 1;
    if (c == 'B') return 2;
    return 3;
}

int get_dp(int l, int r, int d, int u) {
    if (l < 0 || r < 0 || u < 0 || d < 0) return 0;
    return dp[l][r][d][u];
}

int solve() {
    int tp = 0;
    memset(dp, 0, sizeof dp);
    /*for (int i = 0; i < C; ++i, cerr << endl)
        for (int j = 0; j < C; ++j)
            cerr << clr[i][j];*/
    for (int r = 0; r < C; ++r)
        for (int l = r; l >= 0; --l)
            for (int u = 0; u < C; ++u)
                for (int d = u; d >= 0; --d) {
                    ++tp;
                    for (int i = l; i <= r; ++i)
                        for (int j = d; j <= u; ++j)
                            if (clr[i][j] == 1) {
                                vis[get_dp(l, i - 1, d, u) ^ get_dp(i + 1, r, d, u)] = tp; 
                            }
                            else if (clr[i][j] == 2) {
                                vis[get_dp(l, r, d, j - 1) ^ get_dp(l, r, j + 1, u)] = tp;
                            }
                            else if (clr[i][j] == 3) {
                                vis[get_dp(l, i - 1, d, j - 1) ^ get_dp(l, i - 1, j + 1, u) ^ get_dp(i + 1, r, d, j - 1) ^ get_dp(i + 1, r, j + 1, u)] = tp;
                            }
                    for (int i = 0; vis[i] == tp; ++i)
                        dp[l][r][d][u] = i + 1;
                }
    //cerr << dp[0][C - 1][0][C - 1] << "\n";
    return dp[0][C - 1][0][C - 1];
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
        cin >> mp[i];
    if (n == 1 || m == 1) {
        if ((n * m) & 1) cout << "W\n";
        else cout << "L\n";
        return 0;
    }
    int sg = 0;

    memset(clr, 0, sizeof clr);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j) {
            if ((i + j) & 1) continue;
            int x = i + j;
            int y = i - j + C - 1;
            x /= 2, y /= 2;
            clr[x][y] = get_clr(mp[i][j]);
        }

    sg = solve();

    memset(clr, 0, sizeof clr);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j) {
            if ((i + j) % 2 == 0) continue;
            int x = i + j;
            int y = i - j + C - 1;
            x /= 2, y /= 2;
            clr[x][y] = get_clr(mp[i][j]);
        }

    sg ^= solve();

    if (sg) cout << "W\n";
    else cout << "L\n";
}