#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
const int N = 13;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int n, m;
char s[N][N];
bool f[N][N][4][5];
/*
1 : Left
2 : Right
3 : Forward
4 ~ 7 : Goto i - 3
8 ~ 12 : If-open i - 7
*/
std::vector<int> ans;
std::vector<int> now;
bool check(int x, int y, int d, int k)
{
    if(x == 0)
        puts(">");
    if(f[x][y][d][k])
        return 0;
    f[x][y][d][k] = 1;
    if(s[x][y] == 'G')
        return 1;
    if(now[k] == 1)
        return check(x, y, (d + 1) % 4, (k + 1) % (signed)now.size());
    else if(now[k] == 2)
        return check(x, y, (d + 3) % 4, (k + 1) % (signed)now.size());
    else if(now[k] == 3)
    {
        int nx = x + dx[d], ny = y + dy[d];
        if(nx < 1 || nx > n || ny < 1 || ny > m || s[nx][ny] == '#')
            nx = x, ny = y;
        return check(nx, ny, d, (k + 1) % (signed)now.size());
    }
    else if(now[k] >= 4 && now[k] <= 7)
        return check(x, y, d, now[k] - 4);
    else if(now[k] >= 8 && now[k] <= 11)
    {
        int nx = x + dx[d], ny = y + dy[d], nk = now[k] - 8;
        if (nx < 1 || nx > n || ny < 1 || ny > m || s[nx][ny] == '#')
            nk = (k + 1) % (signed)now.size();
        return check(x, y, d, nk);
    }
    return 0;
}
void dfs(int dep)
{
    if(dep > 1)
    {
        memset(f, 0, sizeof(f));
        for (int i = 1; i <= m;++i)
            if(s[1][i] == 'S' && check(1, i, 0, 0) && now.size() < ans.size())
                ans = now;
    }
    if(dep == 5)
        return;
    for (int i = 1; i <= 11;++i)
    {
        if(i >= 4 && i <= 7 && (i - 3 == dep))
            continue;
        if(i >= 8 && i <= 11 && (i - 7 == dep))
            continue;
        now.push_back(i);
        dfs(dep + 1);
        now.pop_back();
    }
    return;
}
int main(void)
{
    scanf("%d%d", &n, &m);
    memset(s, '#', sizeof(s));
    for (int i = 1; i <= n;++i)
        scanf("%s", s[i] + 1), s[i][m + 1] = '#';
    ans = {1, 12, 2, 5, 3};
    dfs(1);
    printf("%d\n", (signed)ans.size());
    for(int x : ans)
    {
        if(x == 1)
            puts("LEFT");
        else if(x == 2)
            puts("RIGHT");
        else if(x == 3)
            puts("FORWARD");
        else if(x >= 4 && x <= 7)
            printf("GOTO %d\n", x - 3);
        else
            printf("IF-OPEN %d\n", x - 7);
    }
    return 0;
}