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

char aa[11][11];
int n, m, Sx, Sy, Ex, Ey;

int LIM;

/*
0: forward
1: left
2: right 
*/ 

int a[11], b[11];

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1}; 

bool ok(int x, int y) {
    return x >= 1 && x <= n && y >= 1 && y <= m && aa[x][y] != '#';
}
 
bool check() {
    bool vis[11][11][4][11];
    memset(vis, 0, sizeof(vis));
    int x = Sx, y = Sy, dir = 0, pc = 0;
    while (1) {
        if (x == Ex && y == Ey) return true;
        if (vis[x][y][dir][pc]) return false;
        vis[x][y][dir][pc] = true;
        if (a[pc] == 0) {
            if (ok(x + dx[dir], y + dy[dir]))
                x += dx[dir], y += dy[dir];
            pc = (pc + 1) % LIM; 
        } else if (a[pc] == 1) {
            dir = (dir + 1) % 4;
            pc = (pc + 1) % LIM; 
        } else if (a[pc] == 2) {
            dir = (dir + 3) % 4;
            pc = (pc + 1) % LIM; 
        } else if (a[pc] == 3) {
            pc = b[pc]; 
        } else {
            if (ok(x + dx[dir], y + dy[dir]))
                pc = b[pc];
            else
                pc = (pc + 1) % LIM; 
        } 
    } 
    assert(0); 
    return false; 
}
 
void dfs(int u) {
    if (u == LIM) {
        if (check()) {
            printf("%d\n", LIM);
            for (int i = 0; i < LIM; i++) {
                if (a[i] == 0) puts("FORWARD");
                else if (a[i] == 1) puts("LEFT");
                else if (a[i] == 2) puts("RIGHT"); 
                else if (a[i] == 3) printf("GOTO %d\n", b[i] + 1);
                else printf("IF-OPEN %d\n", b[i] + 1); 
            } 
            exit(0); 
        }
        return ; 
    } 
    a[u] = 0, dfs(u + 1);
    a[u] = 1, dfs(u + 1);
    a[u] = 2, dfs(u + 1);
    for (int i = 0; i < LIM; i++) {
        if (i == u || i == (u + 1) % LIM) continue;
        a[u] = 3, b[u] = i;
        dfs(u + 1); 
        a[u] = 4, b[u] = i;
        dfs(u + 1); 
    } 
} 

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%s", aa[i] + 1);
        for (int j = 1; j <= m; j++) {
            if (aa[i][j] == 'S')
                Sx = i, Sy = j;
            if (aa[i][j] == 'G')
                Ex = i, Ey = j;
        }
    }
    for (int step = 1; ; step++) {
        LIM = step;
        dfs(0);
    }
    return 0; 
}