#include<bits/stdc++.h>
#define l(x,y) apple(x,y)
using namespace std;
string zl[6]={"","LEFT","FORWARD","RIGHT","GOTO","IF-OPEN"};
struct apple{
	int lz,zz;
	apple(int lz=0,int zz=0):lz(lz),zz(zz){}
}st[19]={l(0,0),l(1,-1),l(2,-1),l(3,-1),l(4,1),l(4,2),
l(4,3),l(4,4),l(5,1),l(5,2),l(5,3),l(5,4),l(5,5)};
const int gs=11;
int n,m;
char s[13][13];
int ans=5;
int mp[6]={0,1,12,3,5,2},pm[6];
struct dij{
	int x,y,mc,zl;
	dij(int x=0,int y=0,int mc=0,int zl=0):
		x(x),y(y),mc(mc),zl(zl){}
	bool operator<(const dij &other)const{
		if(x!=other.x)return x<other.x;
		if(y!=other.y)return y<other.y;
		if(mc!=other.mc)return mc<other.mc;
		return zl<other.zl;
	}
};
int Spx=-1,Spy=-1,Grx=-1,Gry=-1;
int mb[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
bool ok(int x){
	if(x==0)return false;
	map<dij,int>mp;
	dij d(Spx,Spy,2,1);
	while(d.x!=Grx||d.y!=Gry){
		if(mp[d])return false;
		mp[d]=1;
		auto z=st[pm[d.zl]];
		if(z.lz==1){
			d.mc=(d.mc+3)&3;
			d.zl=d.zl%x+1;
		}else if(z.lz==2){
			int dx=d.x+mb[d.mc][0],dy=d.y+mb[d.mc][1];
			if(dx>=1&&dx<=n&&dy>=1&&dy<=m)
				if(s[dx][dy]!='#')d.x=dx,d.y=dy;
			d.zl=d.zl%x+1;
		}else if(z.lz==3){
			d.mc=(d.mc+1)&3;
			d.zl=d.zl%x+1;
		}else if(z.lz==4){
			d.zl=z.zz;
		}else if(z.lz==5){
			int dx=d.x+mb[d.mc][0],dy=d.y+mb[d.mc][1];
			int flag=0;
			if(dx>=1&&dx<=n&&dy>=1&&dy<=m)
				if(s[dx][dy]!='#')d.zl=z.zz,flag=1;
			if(!flag)d.zl=d.zl%x+1;
		}else assert(0);
	}
	return true;
}
void dfs(int stp){
	if(stp>ans)return;
	if(ok(stp-1)){
		ans=stp-1;
		for(int i=1;i<stp;++i)mp[i]=pm[i];
		return;
	}
	if(stp>=ans)return;
	for(int i=1;i<=gs;++i){
		pm[stp]=i;
		dfs(stp+1);
	}
}
void output(apple a){
	cout<<zl[a.lz];
	if(a.lz>=4)printf(" %d",a.zz);
	putchar('\n');
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		scanf("%s",s[i]+1);
		for(int j=1;j<=m;++j){
			if(s[i][j]=='S'){
				Spx=i,Spy=j;
			}else if(s[i][j]=='G'){
				Grx=i,Gry=j;
			}
		}
	}
	dfs(1);
	printf("%d\n",ans);
	for(int i=1;i<=ans;++i)output(st[mp[i]]);
	return 0;
}