#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

/*
0 1  forward
0 2  right
0 3  left
1 k  goto <k>
2 k  if-open <k>
*/

inline bool inside(int x, int y, int n, int m) {
    return x >= 0 && y >= 0 && x < n && y < m;
}

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

char grid[10][10];
int vis[10][10][4][5];

using TP = tuple<int, int, int, int>;
TP parse(TP pos, int op, int n, int m, int tot_op) {
    int x, y, dir, pc;
    tie(x, y, dir, pc) = pos;
    int o1 = op / 10;
    int o2 = op % 10;
    if(o1 == 0 && o2 == 1) {
        x += dx[dir]; y += dy[dir];
        pc = (pc + 1) % tot_op;
        if(!inside(x, y, n, m) || grid[x][y] == '#') {
            x -= dx[dir]; y -= dy[dir];
        }
    } else if(o1 == 0 && o2 == 2) {
        dir = (dir + 1) % 4;
        pc = (pc + 1) % tot_op;
    } else if(o1 == 0 && o2 == 3) {
        dir = (dir + 3) % 4;
        pc = (pc + 1) % tot_op;
    } else if(o1 == 1) {
        pc = o2;
    } else if(o1 == 2) {
        int x2 = x + dx[dir], y2 = y + dy[dir];
        if(inside(x2, y2, n, m) && grid[x2][y2] != '#') {
            pc = o2;
        } else {
            pc = (pc + 1) % tot_op;
        }
    }
    return make_tuple(x, y, dir, pc);
}

vector<int> get_ops(int tot_op) {
    vector<int> op;
    For(i, 1, 3) op.eb(i);
    For(i, 10, 10 + tot_op - 1) op.eb(i);
    For(i, 20, 20 + tot_op - 1) op.eb(i);
    return op;
}

bool check_program(const pii dim, const pii start, const vector<int> &prog) {
    memset(vis, 0, sizeof(vis));
    queue<TP> que;
    auto walk = [&](TP pos) {
        int x, y, dir, pc;
        tie(x, y, dir, pc) = pos;
        // cerr << x << " " << y << " " << dir << " " << pc << "\n";
        if(grid[x][y] == 'G') {
            return 2;
        }
        if(!vis[x][y][dir][pc]) {
            vis[x][y][dir][pc] = 1;
            return 1;
        }
        return 0;
    };
    TP pos(start.F, start.S, 1, 0);
    int res;
    while((res = walk(pos)) == 1) {
        pos = parse(pos, prog[get<3>(pos)], dim.F, dim.S, sz(prog));
        if(get<0>(pos) < 0) return false;
    }
    if(res == 2) return true;
    return false;
}

void dfs(const pii dim, const pii start, int tot_op, const vector<int> &ops, vector<int> &prog) {
    if(sz(prog) == tot_op) {
        if(check_program(dim, start, prog)) {
            cout << tot_op << "\n";
            for(auto &op:prog) {
                int o1 = op / 10, o2 = op % 10;
                if(o1 == 0 && o2 == 1) {
                    cout << "FORWARD\n";
                } else if(o1 == 0 && o2 == 2) {
                    cout << "RIGHT\n";
                } else if(o1 == 0 && o2 == 3) {
                    cout << "LEFT\n";
                } else if(o1 == 1) {
                    cout << "GOTO " << (o2 + 1) << "\n";
                } else if(o1 == 2) {
                    cout << "IF-OPEN " << (o2 + 1) << "\n";
                }
            }
            // for(auto &i:prog) cout << i << " ";
            // cout << "\n";
            exit(0);
        }
        return;
    }
    for(auto &i:ops) {
        if(i / 10 != 0 && i % 10 == sz(prog)) continue;
        prog.eb(i);
        dfs(dim, start, tot_op, ops, prog);
        prog.pop_back();
    }
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m; cin >> n >> m;
    pii start(-1, -1);
    For(i, 0, n - 1) For(j, 0, m - 1) {
        cin >> grid[i][j];
        if(grid[i][j] == 'S') start = pii(i, j);
    }
    // cout << start.F << " " << start.S << "\n";
    // return 0;
    For(i, 1, 5) {
        vector<int> prog;
        dfs(pii(n, m), start, i, get_ops(i), prog);
    }
    cout << "6\n";
    cout << "RIGHT\n";
    cout << "IF-OPEN 6\n";
    cout << "LEFT\n";
    cout << "LEFT\n";
    cout << "GOTO 1\n";
    cout << "FORWARD\n";
    return 0;
}