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

int n , m;
string s[15];
const int mxl = 10;
bool vis[11][11][4][mxl];
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int L ;

struct op{
    int id;
    int l;
}p[15];
bool ok;
int notp[15];
struct point {
    int x,y;
}S , T;
bool is(int x,int y) {
    if(x < 1 || x > n || y < 1 || y > m) return 0;
    if(s[x][y] == '#') return 0;
    return 1;
}
bool check() {
    memset(vis,0,sizeof(vis));
    int cx = S.x , cy = S.y;
    int fs = 0 , pc = 1;
    vis[S.x][S.y][0][1] = 1;
    while(1) {
        if(p[pc].id == 1) {
            pc = p[pc].l;
        }
        else if(p[pc].id == 2) {
            if(is(cx + dx[fs] , cy + dy[fs])) pc = p[pc].l;
            else pc = (pc % L + 1);
        }
        else if(p[pc].id == 3) {
            if(is(cx + dx[fs] , cy + dy[fs])) {
                cx += dx[fs] ; cy += dy[fs];
            }
            pc = (pc % L + 1);
        }
        else if(p[pc].id == 4) {
            fs = (fs + 1) % 4;
            pc = (pc % L + 1);
        }
        else {
            fs = (fs + 3) % 4;
            pc = (pc % L + 1);
        }
        if(cx == T.x && cy == T.y) return 1;
        if(vis[cx][cy][fs][pc]) return 0;
        vis[cx][cy][fs][pc] = 1;
    }
    return 0;
}
void dfs(int u) {
    if(u == L) {
        if(check()) {ok = 1;}
        return ;
    }
    u++;
    for(int id = 1 ; id <= 5 && !ok;id++) {
        p[u].id = id;
        if(id == 1 || id == 2) {
            for(int l = 1;l <= L && !ok;l++) {
                p[u].l = l;
                if(l == u) continue ;
                if(id == 1 && l < u && p[l].id == 1) continue ;
                if(id == 1 && notp[u]) continue ;
                if(id == 1 && l > u) notp[l]++ ;
                dfs(u) ;
                if(id == 1 && l > u) notp[l]-- ;
            }
        }
        else dfs(u);
    }
}
void work() {
    ok = 0;
    dfs(0);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 1 ; i <= n;i++) {
        cin >> s[i];s[i] = "$" + s[i];
        for(int j = 1;j <= m;j++) {
            if(s[i][j] == 'S') {
                S.x = i ; S.y = j;
            }
            if(s[i][j] == 'G') {
                T.x = i ; T.y = j;
            }
        }
    }
    for(L = 1 ; L <= 4 ;L++) {
        work();
        if(ok) {
            printf("%d\n",L);
            for(int i = 1;i <= L;i++) {
                if(p[i].id == 1) printf("GOTO %d\n",p[i].l);
                if(p[i].id == 2) printf("IF-OPEN %d\n",p[i].l);
                if(p[i].id == 3) printf("FORWARD\n");
                if(p[i].id == 4) printf("LEFT\n");
                if(p[i].id == 5) printf("RIGHT\n");
            }
            return 0;
        }
        // cerr << "chk " << L << '\n';
    }
    {
        p[1].id=1;
        p[1].l=3;
        p[2].id=5;
        p[3].id=3;
        p[4].id=2;
        p[4].l=2;
        p[5].id=4;
        if(check())
            cout<<"5\nGOTO 3\nRIGHT\nFORWARD\nIF-OPEN 2\nLEFT\n";
        else
            cout<<"5\nGOTO 3\nLEFT\nFORWARD\nIF-OPEN 2\nRIGHT\n";
    }

    return 0;
}