#include<bits/stdc++.h>
using namespace std;
int n,m,c,t,w,sx,sy,dw,cnt;
char a[55][55];
string s[1005];
bool u[55][55];
struct node{
	int x,y,z;
}q[10000005];
void work_1()
{
	int i=q[t].x-1,j=q[t].y;
	while(i<=n&&i>=1&&j<=m&&j>=1&&a[i][j]=='.')
	{
		++w;++dw;
		q[w].x=i;q[w].y=j;q[w].z=q[t].z+1;
		--i;
	}
}
void work_2()
{
	int i=q[t].x+1,j=q[t].y;
	while(i<=n&&i>=1&&j<=m&&j>=1&&a[i][j]=='.')
	{
		++w;++dw;
		q[w].x=i;q[w].y=j;q[w].z=q[t].z+1;
		++i;
	}
}
void work_3()
{
	int i=q[t].x,j=q[t].y+1;
	while(i<=n&&i>=1&&j<=m&&j>=1&&a[i][j]=='.')
	{
		++w;++dw;
		q[w].x=i;q[w].y=j;q[w].z=q[t].z+1;
		++j;
	}
}
void work_4()
{
	int i=q[t].x,j=q[t].y-1;
	while(i<=n&&i>=1&&j<=m&&j>=1&&a[i][j]=='.')
	{
		++w;++dw;
		q[w].x=i;q[w].y=j;q[w].z=q[t].z+1;
		--j;
	}
}
int main()
{
	//freopen("search.in","r",stdin);
	//freopen("search.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
		{
			cin>>a[i][j];
			if(a[i][j]=='*'){sx=i;sy=j;a[i][j]='.';}
		}
	scanf("%d",&c);
	for(int i=1;i<=c;++i) cin>>s[i];
	t=w=1;
	q[1].x=sx;q[1].y=sy;
	for(int i=1;i<=c;++i)
	{
		if(i==1) cnt=1;
		for(int j=1;j<=cnt;++j)
		{
			if(s[i]=="NORTH") work_1();
			if(s[i]=="SOUTH") work_2();
			if(s[i]=="EAST")  work_3();
			if(s[i]=="WEST")  work_4();
			++t;
		}
		cnt=dw;dw=0;
	}
	for(int i=w;q[i].z==c;--i)
		u[q[i].x][q[i].y]=1;
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			if(a[i][j]=='.'&&u[i][j]) cout<<"*";
			if(a[i][j]=='X') cout<<"X";
			if(a[i][j]=='.'&&!u[i][j]) cout<<".";
		}
		puts("");
	}
	return 0;
}