#include<iostream>
#include<cstdio>
using namespace std;
bool f=true;
int tag=0;
int kx,ky;
int count;
char arr[5][5];
void print()
{
	for(int i=0;i<5;i++)
	{
		for(int j=0;j<4;j++)
		{
			cout<<arr[i][j]<<" ";
		}
		cout<<arr[i][4]<<endl;
	}
}
void init()
{
	tag=kx=ky=0;
	for(int i=0;i<5;i++)
	{
		for(int j=0;j<5;j++)
		{
			arr[i][j]=' ';
		}
	}
}
int main()
{
	char ch;
	while(true)
	{
		ch=getchar();
		if(ch=='Z')return 0;
		if(f==true)
		{
			init();
			arr[0][0]=ch;
			for(int j=1;j<5;j++)scanf("%c",&arr[0][j]);
			ch=getchar();
			for(int i=1;i<5;i++)
			{
				for(int j=0;j<5;j++)
				{
					scanf("%c",&arr[i][j]);
					if(arr[i][j]==' ')kx=i,ky=j;
				}
				ch=getchar();
			}
			f=false;
		}
		else
		{
			if(ch=='0'&&tag==1)
			{
				printf("Puzzle #%d:\n",++count);
				printf("This puzzle has no final configuration.\n");
				ch=getchar();
				f=true;
				continue;
			}
			if(ch=='0'&&tag==0)
			{
				printf("Puzzle #%d:\n",++count);
				print();
				ch=getchar();
				f=true;
			}
			else
			{
				if(ch=='A'&&tag==0)
				{
					if(kx!=0)
					{
						char tmp=arr[kx-1][ky];
						arr[kx][ky]=tmp;
						arr[kx-1][ky]=' ';
						kx--;
					}
					else 
					{
						tag=1;
						continue;
					}
				}
				
				if(ch=='B'&&tag==0)
				{
					if(kx!=4)
					{
						char tmp=arr[kx+1][ky];
						arr[kx][ky]=tmp;
						arr[kx+1][ky]=' ';
						kx++;
					}
					else 
					{
						tag=1;
						continue;
					}
				}
				if(ch=='L'&&tag==0)
				{
					if(ky!=0)
					{
						char tmp=arr[kx][ky-1];
						arr[kx][ky]=tmp;
						arr[kx][ky-1]=' ';
						ky--;
					}
					else
					{
						tag=1;
						continue;
					} 
				}
				if(ch=='R'&&tag==0)
				{
					if(ky!=4)
					{
						char tmp=arr[kx][ky+1];
						arr[kx][ky]=tmp;
						arr[kx][ky+1]=' ';
						ky++;
					}
					else
					{	
						tag=1;
						continue;
					} 
				}
			}
		}
	}
	return 0;
}