// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 200005
#define inf 0x3f3f3f3f

int sx,sy,tx,ty,n,m,k;
char s[12][12];
bool vis[12][12][5][5];

int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
string op[23]={"","GOTO","IF-OPEN","FORWARD","LEFT","RIGHT"};
int a[23],b[23];

bool isok(int x,int y){
	return x>=1 && y>=1 && x<=n && y<=m && s[x][y]!='#';
}
bool chk(){
	memset(vis,0,sizeof vis);
	int x=sx,y=sy,d=0,i=1;
	while(1){
		if(vis[x][y][d][i])return 0;
		if(x==tx && y==ty)return 1;
		vis[x][y][d][i]=1;
		int xx=x+dx[d],yy=y+dy[d];
		if(a[i]==1) {
			i=b[i];
			continue;
		}
		else if(a[i]==2) {
			if(isok(xx,yy)) {
				i=b[i];
				continue;
			}
		}
		else if(a[i]==3){
			if(isok(xx,yy)) x=xx,y=yy;
		}
		else if(a[i]==4)
			d=(d+1)%4;
		else d=(d+3)%4;
		++i;
		if(i>k) i=1;
	}
}

void dfs(int u){
	if(u==k+1){
		if(chk()){
			cout<<k<<"\n";
			For(i,1,k){
				if(a[i]<=2) cout<<op[a[i]]<<' '<<b[i]<<"\n";
				else cout<<op[a[i]]<<"\n";
			}
			exit(0);
		}
		return;
	}
	For(i,1,2)For(j,1,k)a[u]=i,b[u]=j,dfs(u+1);
	For(i,3,5)a[u]=i,dfs(u+1);
}

signed main()
{
	n=read(),m=read();
	For(i,1,n){
		cin>>(s[i]+1);
		For(j,1,m){
			if(s[i][j]=='S') s[i][j]='.',sx=i,sy=j;
			if(s[i][j]=='G') s[i][j]='.',tx=i,ty=j;
		}
	}
	For(i,1,4){
		k=i;
		dfs(1);
	}
	puts("5");
	puts("LEFT");
	puts("IF-OPEN 5");
	puts("RIGHT");
	puts("GOTO 2");
	puts("FORWARD");
	return 0;
}
/*

*/