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

int H, W;
int Index1[59][59];
int Index2[59][59];
int dp[59][59][59][59];
char C[59][59];

int dfs(int lx, int rx, int ly, int ry, int t) {
    if (dp[lx][rx][ly][ry] >= 0) return dp[lx][rx][ly][ry];
    bool ret[319];
    for (int i = 0; i < 319; i++) ret[i] = false;

    // Solve
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if ((i + j) % 2 != t) continue;
            if (!(lx <= Index1[i][j] && Index1[i][j] <= rx)) continue;
            if (!(ly <= Index2[i][j] && Index2[i][j] <= ry)) continue;

            // Get Result
            int result = 0;
            if (C[i][j] == 'B') {
                int v1 = dfs(lx, rx, ly, Index2[i][j] - 1, t);
                int v2 = dfs(lx, rx, Index2[i][j] + 1, ry, t);
                result = (v1 ^ v2);
            }
            if (C[i][j] == 'R') {
                int v1 = dfs(lx, Index1[i][j] - 1, ly, ry, t);
                int v2 = dfs(Index1[i][j] + 1, rx, ly, ry, t);
                result = (v1 ^ v2);
            }
            if (C[i][j] == 'G') {
                int v1 = dfs(lx, Index1[i][j] - 1, ly, Index2[i][j] - 1, t);
                int v2 = dfs(lx, Index1[i][j] - 1, Index2[i][j] + 1, ry, t);
                int v3 = dfs(Index1[i][j] + 1, rx, ly, Index2[i][j] - 1, t);
                int v4 = dfs(Index1[i][j] + 1, rx, Index2[i][j] + 1, ry, t);
                result = (v1 ^ (v2 ^ (v3 ^ v4)));
            }

            // Update
            if (result < 319) ret[result] = true;
        }
    }

    // Update
    for (int i = 0; i < 319; i++) {
        if (ret[i] == false) {
            dp[lx][rx][ly][ry] = i;
            return i;
        }
    }
    return -1;
}

int main() {
    // Step 1. Input
    cin >> H >> W;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) cin >> C[i][j];
    }

    // Step 2. Solve Init
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            Index1[i][j] = i + j + 1;
            Index2[i][j] = i - j + W + 1;
        }
    }

    // Step 3. Solve Main
    int Answer[2] = {0, 0};
    for (int t = 0; t < 2; t++) {
        for (int i = 0; i <= H + W; i++) {
            for (int j = 0; j <= H + W; j++) {
                for (int k = 0; k <= H + W; k++) {
                    for (int l = 0; l <= H + W; l++) dp[i][j][k][l] = -1;
                }
            }
        }

        // Solve
        Answer[t] = dfs(0, H + W, 0, H + W, t);
    }

    // Step 4. Output
    int x = (Answer[0] ^ Answer[1]);
    cout << (x == 0 ? "L" : "W") << endl;
    return 0;
}