#include<bits/stdc++.h>
#define ll long long
using namespace std;
char ch[105][105];
int k[105][105],p=2,x,y;
char d[]={'N','E','S','W'};
int flag=0;
bool dfs(int x,int y){
	if(flag==1) return 1;
	if(ch[x][y]=='?') flag=1;
	k[x][y]=-1;
	if(x>1&&(k[x-1][y]!=1&&k[x-1][y]!=-1)) dfs(x-1,y);
	if((k[x+1][y]!=1&&k[x+1][y]!=-1)) dfs(x+1,y);
	if(y>1&&(k[x][y-1]!=1&&k[x][y-1]!=-1)) dfs(x,y-1);
	if((k[x][y+1]!=1&&k[x][y+1]!=-1)) dfs(x,y+1);
	k[x][y]=0;
	return 0;
}
bool check(int x,int y){
	bool fp=0;
	for(int i=1;i<=105;i++)
		for(int j=1;j<=105;j++)
			if(ch[i][j]=='?') fp=1;
	return !fp||dfs(x,y);
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(),cout.tie();
	memset(ch,'?',sizeof(ch));
	while(1){
		string s;
		cin>>s;
		if(s=="left") p=p-1+(p==0?0:1);
		if(s=="right") p=(p+1)%4;
		if(s=="go"){
			if(!p%2) x+=p-2;
			else y+=p-3; 
		}
		if(check(x,y)){
			cout<<"End\n3 3\n###\n#.#\n###\n";
			return 0;
		}
	}
	return 0;
}